max sum-dp

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

#include <bits/stdc++.h>
using namespace std;
int a[100005],dp[100005];
int main()
{
    int n,m,num=0,p;
    cin>>n;
    p=n;
    while(n--)
    {
        num++;
        memset(dp,0,sizeof(dp));
        memset(a,0,sizeof(a));
        cin>>m;
        for(int i=1;i<=m;i++)
            cin>>a[i];
        dp[1]=a[1];
        for(int i=2;i<=m;i++)
        {
            if(dp[i-1]>=0)
                dp[i]=a[i]+dp[i-1];
            else 
                dp[i]=a[i];
        }
        int max=-10000,s=0,e=1;
        for(int i=1;i<=m;i++)
            if(dp[i]>max)
            {
                max=dp[i];
                e=i;
            }
        for(int k=e-1;k>=1;k--)
            if(dp[k]<0)
            {
                s=k;
                break;
            }
        cout<<"Case "<<num<<":"<<endl;
        cout<<dp[e]<<" "<<s+1<<" "<<e<<endl;
        if(num<p)
            cout<<endl;
    }
    return 0;
}