Max Sum（最大子序和）

 1 #include <iostream>
 2 #include <stdio.h> 
 3 using namespace std;
 4 int main()
 5 {
 6     int T,c=1;
 7     scanf("%d",&T);
 8     while(T--)
 9     {
10         int N,i,sum=0,max=-1001,t=1,start,end,n;
11         cin>>N;
12         for(i=1;i<=N;i++)
13         {
14             scanf("%d",&n);
15             sum=sum+n;
16             if(sum>max)
17             {
18                 max=sum;
19                 start=t;
20                 end=i;
21             }
22             if(sum<0)
23             {
24                 sum=0;t=i+1;
25             }
26         }
27         cout<<"Case "<<c++<<":"<<endl;
28         cout<<max<<" "<<start<<" "<<end<<endl;
29         if(T!=0)
30             cout<<endl;
31     }