1003 Max Sum

Max Sum

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

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

代码

#include <iostream>
#include <cstdio>

using namespace std;

int main()
{
    int n, k = 0;
    cin >> n;
    while(k++ < n)
    {
        int a, x, star = 1, end = 1;
        cin >> a;
        int sum = 0, max = -1001;
        for(int i = 1, j = 1; i <= a; i++)
        {
            cin >> x;
            sum += x;
            if(sum > max)
            {
                star = j;
                end = i;
                max = sum;
            }
            if(sum < 0)
            {
                j = i+1;
                sum = 0;
            }
        }
        cout << "Case " << k << ":" << endl;
        cout << max << " " << star << " " << end << endl;
        if(k != n)
            cout << endl;
    }
    return 0;
}

该题要求最大字串之和，在输入的过程中进行求和、更新数据，只要和不小于0就可以继续，小于0的时候重置所有项，最后比对每次的和与保存的sum比大小即可