求最大连续子序列问题（浙大考研复试题）动态规划

题目

样例输入

6
-2 11 -4 13 -5 -2
10
-10 1 2 3 4 -5 -23 3 7 -21
6
5 -8 3 2 5 0
1
10
3
-1 -5 -2
3
-1 0 -2
0

样例输出

20 11 13
10 1 4
10 3 5
10 10 10
-1 -1 -1
0 0 0

代码

#include <iostream>
#include <cstdio>
using namespace std;
void maxSubsequenceWihtBeginAndEnd(int arr[], int n){

     int dp[n + 10];
     dp[0] = arr[0];
     int maximum = dp[0];
     int left = 0, right = 0;

     for (int i = 1; i < n; i ++){
         dp[i] = max(arr[i], dp[i - 1] + arr[i]);
         if (dp[i] > maximum){
             maximum = dp[i];
             right = i;
         }
     }
     int k = maximum;
     for (int j = right; j >= 0; j --){
         if ((k -= arr[j]) == 0){
             left = j;
             break;
         }
     }
     cout << maximum << " " << arr[left] << " " << arr[right] << endl;
}

int main() {
    int n;
    while (scanf("%d", &n) != EOF && n){
        int a[n];
        for (int i = 0; i < n; i ++){
            scanf("%d", &a[i]);
        }
        s.maxSubsequenceWihtBeginAndEnd(a, n);
    }

    return 0;
}