HDOJ1003（连续最大和）

#include<iostream>
#include<algorithm>
using namespace std;
#define N 100010


int a[N];


int main()
{
int t;
cin >> t;
for (int i = 1; i <= t; i++)
{
int n, m = -1001,sum=0;
int s = 1, e = 1, te = 1;
cin >> n;
for (int i = 1; i <= n; i++)
{
cin >> a[i];
sum += a[i];
if (sum > m)
{
m = sum;
e = i;
s = te;
}
if (sum < 0)
{
te= i + 1;
sum = 0;
}
}
cout << "Case " << i << ":" << endl;
cout << m << " " << s << " " << e<<endl;
if (i < t) cout << endl;
}
return 0;
}