Max Sum（最大子串和）

 1 #include <stdio.h>
 2 #include <string.h>
 3 
 4 int a[100002];
 5 
 6 main()
 7 {
 8     int T,N,kkk=1,i,j;
 9 
10     scanf("%d",&T);
11     while(T--)
12     {
13         int max,max_s,max_e,sum,sum_s;
14         //memset
15         printf("Case %d:\n",kkk++);
16 
17         scanf("%d",&N);
18         for(i=1;i<=N;i++)
19         {
20             scanf("%d",&a[i]);
21         }
22 
23         max = sum = a[1];
24         max_s = max_e = sum_s = 1;
25 
26         //printf("sum = %d  max = %d\n",sum,max);
27         for(i=2;i<=N;i++)
28         {
29             if(sum + a[i] < a[i])
30             {
31                 sum = a[i] ;
32                 sum_s = i ;
33             }
34             else sum = sum + a[i] ;
35 
36             if(sum > max)
37             {
38                 max = sum ;
39                 max_s = sum_s;
40                 max_e = i;
41             }
42             //printf("sum = %d  max = %d\n",sum,max);
43         }
44         printf("%d %d %d\n",max,max_s,max_e);
45         if(T)
46         printf("\n");
47     }
48 }