max sum

 Max Sum

Given 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

2
5 6 -1 5 4 -7
7 0 6 -1 1 -6 7 -5

Sample Output

Case 1:
14 1 4

Case 2:
7 1 6

思路：数列中，head为第一项，tail为最后一项，sum为head至tail的这几项的和，如果sum是最大的数，那么令ma=sum且改变tail，如果sum<0，那么从它的后一项开始为head。

代码：

#include<stdio.h>
int main()
{
    int t,n,a;
    scanf("%d",&t);
    for(int i=0; i<t; i++)
    {
        scanf("%d",&n);
        int sum=0,ma=-1000,head=0,tail=0,tem=1;
        for(int j=0; j<n; j++)
        {
            scanf("%d",&a);
            sum+=a;
            if(sum>ma)
            {
                ma=sum;
                head=tem;
                tail=j+1;
            }
            if(sum<0)
            {
                sum=0;
                tem=j+2;
            }
        }
        printf("Case %d:\n%d %d %d\n",i+1,ma,head,tail);
        if(i!=t-1)
            printf("\n");
    }
    return 0;
}