HDU 1003

Max Sum

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

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

//第二组错误，输出了 7 7
#include <cstdio>
#include <cstring>
using namespace std;

const int maxn = 100010;

int ans[maxn] = {0};
int b[maxn][2] = {0};
int a[maxn];

int main()
{
    int i,j,k;
    int T;
    scanf("%d",&T);
    int n,m;
    int num;
    int flag = 1;
    int temp = T;
    while(T--)
    {
        scanf("%d",&num);
        memset(ans,0,sizeof(ans));
        memset(b,0,sizeof(b));
        memset(a,0,sizeof(a));


        for(i=1; i<=num; i++)
            scanf("%d",a+i);
        ans[1] = a[1];
        b[1][0] = b[1][1] = 1;
        int max = -1;
        int next;
        for(i=2; i<=num; i++)
        {
            if(ans[i-1]>0)
            {
                ans[i] = ans[i-1] + a[i];
                //if(a[i]>0)
                {
                    b[i][0] = b[i-1][0];
                    b[i][1] = i;
                }
               // else
               // {
               //     b[i][0] = b[i-1][0];
               //     b[i][1] = i-1;
               // }
            }
            else
            {
                ans[i] = a[i];
                b[i][0] = b[i][1] = i;
            }
            if(ans[i]>max)
            {
                max = ans[i];
                next = i;
            }

        }
        printf("Case %d:\n",flag);
        printf("%d %d %d\n",max,b[next][0],b[next][1]);
        if(flag<temp)
            printf("\n");
        flag++;
    }
    return 0;
}

#include <cstdio>
#include <cstring>
using namespace std;

const int maxn = 100010;
int a[maxn] = {0};

int main()
{
    int i,j,k;
    int T;
    scanf("%d",&T);
    int num;
    int flag = 1;
    int sum = 0;
    int start,end,last;
    int temp = T;
    while(T--)
    {
        
        int max = (1<<31);
        scanf("%d",&num);
        memset(a,0,sizeof(a));
        sum = 0;
        last = 1;
        for(i=1; i<=num; i++)
        {
            scanf("%d",a+i);
            sum += a[i];
            if(sum>max)
            {
                start = last;
                max= sum;
                end = i;
            }
            if(sum<0)
            {
                sum = 0;
                last = i+1;
            }

        }
        printf("Case %d:\n",flag);
        printf("%d %d %d\n",max,start,end);
        if(flag<temp)
            printf("\n");
        flag++;
    }
    while(1);
    return 0;
}