最大连续子序和

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
  
  
  
  

   
   数组d[]，d[i]表示前i个数中和的最大值 。
  
  
  
  

   
   
   
   
#include <iostream>
using namespace std;
#define N 100001
int a[N];
int main()
{
    int T;
    cin>>T;
    int kase=0;
    while(T--)
    {
                    int n;
                    cin>>n;
                    for(int i=1;i<=n;i++) cin>>a[i];
                    int d[N];
                    d[1]=a[1];
                    for(int i=2;i<=n;i++)
                    {
                                    if(d[i-1]<0) d[i]=a[i];
                                    else d[i]=d[i-1]+a[i];
                    }
                    int max=d[1],e=1;
                    for(int i=1;i<=n;i++)
                    {
                                    if(max<d[i])
                                    {
                                                    max=d[i];
                                                    e=i;
                                    }
                    }
                    int t=0,f=e;
                    for(int j=e;j>=1;j--)
                    {
                                    t=t+a[j];
                                    if(t==max) f=j;
                    }
                    cout<<"Case "<<++kase<<":"<<endl<<max<<" "<<f<<" "<<e<<endl;
                    if(T) cout<<endl;
    }
    return 0;
}