Hdu1003 Max sum (calculate the maximum field sum)

In fact, the three articles published in a row are exactly the same ideas. I just want to give them another one!

Question link: http://acm.hdu.edu.cn/showproblem.php? PID = 1, 1003

Problem descriptiongiven a sequence a [1], a [2], a [3] ...... A [n], your job is to calculate the max sum of a sub-sequence. for example, given (6,-1, 5, 4,-7), the Max sum in this sequence is 6 + (-1) + 5 + 4 = 14.
Inputthe first line of the input contains an integer T (1 <= T <= 20) which means the number of test cases. then T lines follow, each line starts with a number N (1 <= n <= 100000), then n integers followed (all the integers are between-1000 and 1000 ).
Outputfor each test case, you should output two lines. the first line is "case #:", # means the number of the test case. the second line contains three integers, the max sum in the sequence, the start position of the sub-sequence, the end position of the sub-sequence. if there are more than one result, output the first one. output a blank line between two cases.
Sample Input

25 6 -1 5 4 -77 0 6 -1 1 -6 7 -5

Sample output

Case 1:14 1 4Case 2:7 1 6

The Code is as follows:

#include <cstdio>#define INF 0x3fffffff#define M 100000+17int a[M];int main(){int n, i, T, k = 0;while(~scanf("%d",&T)){while(T--){scanf("%d",&n);int s = 1, e = 1, t = 1;int sum = 0, MAX = -INF;for(i = 1; i <= n; i++){scanf("%d",&a[i]);sum+=a[i];if(sum > MAX){s = t;e = i;MAX = sum;}if(sum < 0){t = i+1;sum = 0;}}printf("Case %d:\n",++k);printf("%d %d %d\n",MAX,s,e);if(T!=0)printf("\n");}}return 0;}