代碼如下:
#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
#include<cmath>
using namespace std;
typedef long long ll;
const int N = 1e5+10;
int n, s, e, k;
int a[N];
int main()
{
int t , j;
scanf("%d", &t);
for(j = 1; j <= t; j++)
{
scanf("%d", &n);
int maxn = -9999;
int sum = 0;
s = e = k = 1;
for(int i = 1; i <= n; i++)
{
scanf("%d", &a[i]);
sum += a[i];
if(sum > maxn)
{
maxn = sum;
s = k;
e = i;
}
if(sum < 0)
{
sum = 0; k = i + 1;
}
}
if(j != 1) printf("\n");
printf("Case %d:\n", j);
printf("%d %d %d\n", maxn, s, e);
}
return 0;
}