Create 01-复杂度2 Maximum Subsequence Sum (25 分).cpp

gaochuang98 · May 1, 2019 · d535956 · d535956
1 parent 8a0a884
commit d535956
Showing 1 changed file with 24 additions and 0 deletions.
diff --git a/ZJU_MOOC_数据结构/01-复杂度2 Maximum Subsequence Sum (25 分).cpp b/ZJU_MOOC_数据结构/01-复杂度2 Maximum Subsequence Sum (25 分).cpp
@@ -0,0 +1,24 @@
+#include <iostream>
+#include <vector>
+using namespace std;
+int main() {
+    int n;
+    scanf("%d", &n);
+    vector<int> v(n);
+    int leftindex = 0, rightindex = n - 1, sum = -1, temp = 0, tempindex = 0;
+    for (int i = 0; i < n; i++) {
+        scanf("%d", &v[i]);
+        temp = temp + v[i];
+        if (temp < 0) {
+            temp = 0;
+            tempindex = i + 1;
+        } else if (temp > sum) {
+            sum = temp;
+            leftindex = tempindex;
+            rightindex = i;
+        }
+    }
+    if (sum < 0) sum = 0;
+    printf("%d %d %d", sum, v[leftindex], v[rightindex]);
+    return 0;
+}