Create 1007.Maximum Subsequence Sum （25 分).cpp

gaochuang98 · Apr 18, 2019 · 8883d67 · 8883d67
1 parent 1f9a2b7
commit 8883d67
Showing 1 changed file with 25 additions and 0 deletions.
diff --git a/PAT/PAT-A/CPP/1007.Maximum Subsequence Sum （25 分).cpp b/PAT/PAT-A/CPP/1007.Maximum Subsequence Sum （25 分).cpp
@@ -0,0 +1,25 @@
+#include <iostream>
+#include <vector>
+using namespace std;
+
+int main(){
+	int n;
+	cin >> n;
+	vector<int> v(n);
+	int start = 0, end = n - 1, sum = -1, temp = 0, tempindex = 0;
+	for(int i = 0; i < n; i++){
+		cin >> v[i];
+		temp = temp + v[i];
+		if(temp < 0){
+			temp = 0;
+			tempindex = i + 1; 
+		}else if(temp > sum){
+			sum = temp;
+			start = tempindex;
+			end = i;
+		} 
+	}
+	if(sum < 0) sum = 0;
+	printf("%d %d %d", sum, v[start], v[end]);
+	return 0;
+}