最大子列和

Max Sum

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

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

问题

没有使用s[i]=s[i-1]+a[i]的递推式，导致程序超时。

代码

#include <string.h>
#include <stdio.h>
#include <iostream>
using namespace std;
int s[100100];
int b[100010];
int a[100010];
int main()
{
    int t;
    cin >> t;
    int sum, n; int ca = 1;
    while (t--)
    {
        int max = -100, flag;
        cin >> a[0];
        b[0]=1;
        for (int i = 1; i <= a[0]; i++)
        {
            cin >> a[i];
            if (s[i-1] >= 0)
            {
                s[i] = s[i - 1] + a[i];         
                b[i] = b[i - 1];
            }
            else
            {
                s[i] = a[i]; b[i] = i;
            }
            if (s[i]>max)
            {
                max = s[i];
                flag = i;
            }
        }
        printf("Case %d:\n", ca);
        ca++;
        if (t>0)
            printf("%d %d %d\n\n", max, b[flag], flag);
        else
            printf("%d %d %d\n", max, b[flag], flag);
    }
    return 0;
}