杭电OJ1003

#include “iostream”
using namespace std;
int a[100005], sum[100005];
int main()
{
int x,n, max,l=1;
cin >> x;
while (x)
{
cin >> n;
int t=1,j,m;
for (int i = 1; i <=n; i++)
{
cin >> a[i];
sum[i] = a[i];
if (sum[i-1] >= 0)
sum[i] = sum[i] + sum[i - 1];
}
max = sum[1];
cout << "Case " << l++ << ‘:’ << endl;
for ( m = 2; m <= n; m++)
{
if (sum[m] >max)
{
max = sum[m];
t = m;
}
}
int s=max,v;
if (t == 1)
cout << max<<’ ’ << “1 1”<< endl;
else
{
for (j =t; j >=1; j–)
{
s = s- a[j];
if (s == 0)
{
v = j;
}
}
cout << max << ’ ’ << v<< ’ ’ << t<< endl;
}
if (x > 1)
cout << endl;
x- -;
}
}