Max Sum

Time Limit: 2000/1000 MS (Java/Others)
Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 178412
Accepted Submission(s): 41634

Problem Description
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.

Input
The 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).

Output
For 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

最初想到的是用两层for循环求出它的所有子列的和，输出最大的，却总是超时，看了别人的代码后继续研究，提交八次的题，注意

#include<stdio.h>
#define max 100000
int main()
{
    int sum,maxx,t,n,x,z,y,a[max];
    scanf("%d",&t);
    for(int k=1;k<=t;k++)
    {
        scanf("%d",&n);
        for(int i=1;i<=n;i++)
        scanf("%d",&a[i]);
        sum=0;maxx=-1111;
        x=z=y=1;
        for(int j=1;j<=n;j++)
        {
            sum+=a[j];
            if(sum>maxx)//两个if的位置绝对不能调换
            {
                x=z;
                y=j;
                maxx=sum;
            }
            if(sum<0)//放在上面后，若先输入负数就会出错
            {
                z=i+1;
                sum=0;
            }
        }
        printf("Case %d:\n",k);
        printf("%d %d %d\n",maxx,x,y);
        if(k!=t)//最后一个不能有两次换行，会出现Presentation Error
        printf("\n");
    }
    return 0;
}