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

这道题核心就是一个求和，然后把加过一个数后的sum与下个再加另一个数后的比较，中间需要用几个变量来标记位置以及一个初始化的过程
代码如下
Sample Output

Case 1:
14 1 4

Case 2:
7 1 6

#include<stdio.h>
int p[100101];
int main()
{
    int t,k=0,q;
    scanf("%d",&t);
    q=t;
    while(t--)
    {
        int sum=0,n,i;
        scanf("%d",&n);
        for(i=1;i<=n;i++)
            scanf("%d",&p[i]);
            printf("Case %d:\n",++k);
            int s=1,b=1,a=1;
        int max=-99999;
        for(i=1;i<=n;i++)
        {
            sum=sum+p[i];
            if(sum>max)
            {
                max=sum;
                a=b;
                s=i;
            }
            if(sum<0)
            {
                sum=0;
                b=i+1;
            }
        }
        printf("%d %d %d\n",max,a,s);
        if(k<q)
        printf("\n");
    }
    return 0;
}