最大连续子序列和(动态规划):状态方程:dp[i] = max(a[i], a[i] + dp[i-1])
#include <cstdio>
#include <algorithm>
using namespace std;
const int maxn = 100010;
int a[maxn];
struct node{
int start;
int total;
};
node dp[maxn];
int main(void){
int t;
scanf("%d", &t);
for(int m = 1; m <= t; m++){
int n;
scanf("%d", &n);
for(int i = 0; i < n; i++){
scanf("%d", &a[i]);
}
//边界
dp[0].total = a[0];
dp[0].start = 1;
for(int i = 1; i < n; i++){
dp[i].total = max(a[i], dp[i-1].total+a[i]);
if(a[i] <= dp[i-1].total+a[i]){
dp[i].start = dp[i-1].start;
}else{
dp[i].start = i + 1;
}
}
int k = 0;
for(int i = 1; i < n; i++){
if(dp[i].total > dp[k].total){
k = i;
}
}
printf("Case %d:\n", m);
printf("%d %d %d\n", dp[k].total, dp[k].start, k+1);
if(m < t){
printf("\n");
}
}
return 0;
}