杭电 1003[Max Sum]

不过我还是不太了解动态规划的思想╮(╯▽╰)╭

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
  
  

 

由于一开始不理解题意，上网参考了一段代码然后加以自己的理解作了修改。

但还是WA好几次，贴上代码纪念一下。

#include <iostream>
using namespace std;
void main()
{
    int n,c,num,begpos,endpos,p,sum,maxsum;
    int i, j;
    cin>>n;
    for(i=1;i<=n;i++)
    {
        begpos=1;
        endpos=1;
        p=1;
        sum=0;
        maxsum=-1000;
        cin>>c;
        for(j=1;j<=c;j++)
        {
            cin>>num;
            sum+=num;
            if(sum>maxsum)
            {
                maxsum=sum;
                begpos=p;
                endpos=j;
            }
            if(sum<0)
            {
                p=j+1;
                sum=0;
            }
        }
        cout<<"Case "<<i<<":"<<endl;
        cout<<maxsum<<" "<<begpos<<" "<<endpos;
        if(i==n) cout<<endl;
        else cout<<endl<<endl;
    }
}