HDOJ_ACM_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

 

Code

two programs are all accepted.

//input, then two for, record begin, end and the max
#include <stdio.h>
#define N 100000
int f[N + 5];
int main()
{
    int T, n, i, j, k, t, begin, end, max, sum;
    scanf("%d", &T);
    for (k = 1; k <= T; k++)
    {
        //input
        scanf("%d", &n);
        for (t = 0; t < n; t++)
            scanf("%d", &f[t]);
        //find the result
        for (max = -1001, begin = 0, i = 0; i < n; i++)
        {
            for (sum = 0, j = i; j < n; j++)
            {
                sum += f[j];
                //if sum is bigger than max, then record.
                if (sum > max)
                {
                    begin = i;
                    end = j;
                    max = sum;
                }
                //if sum is smaller than zero, then jump to j. ★
                if (sum < 0)
                {
                    i = j;
                    break;
                }
            }
        }
        //formatting printing
        printf("Case %d:\n", k);
        printf("%d %d %d\n", max, begin + 1, end + 1);
        if (k != T)
            puts("");
    }
    return 0;
}

//input, then two for, record begin, end and the max
#include <stdio.h>
#define N 100000
int f[N + 5];
int main()
{
    int T, n, i, j, k, t, begin, end, max, sum, flag;
    scanf("%d", &T);
    for (k = 1; k <= T; k++)
    {
        flag = 0;
        //input
        scanf("%d", &n);
        for (t = 0; t < n; t++)
        {
            scanf("%d", &f[t]);
            if (f[t] > 0)
                flag = 1;
        }
        max = -1001;
        begin = 0;
        //if flag is equal to zero which means the all number is small than zero
        if (flag == 0)
        {
            for (i = 0; i < n; i++)
            {
                if (f[i] > max)
                {
                    max = f[i];
                    begin = i;
                    end = i;
                }
            }
        }
        else 
        {
            for (i = 0; i < n; i++)
            {
                sum = 0;
                //if the begin number is small than zero, then jump.
                if (f[i] < 0)
                    continue;
                for (j = i; j < n; j++)
                {
                    sum += f[j];
                    //if sum is small than zero, then jump.
                    if (sum < 0)
                        break;
                    if (sum > max)
                    {
                        begin = i;
                        end = j;
                        max = sum;
                    }
                }
            }
        }
        printf("Case %d:\n", k);
        printf("%d %d %d\n", max, begin + 1, end + 1);
        if (k != T)
            puts("");
    }
    return 0;
}

The first one

for example, 4 4 -5 1 2. when i = 1, j = 2, then sum = 4 + -5 = -1, then make i = j = 2. Because the sum of the before number is samller than zero, you can start with postive interger.

The second one

the program judge whether all number is  negative, when it is negative, just find the max number and the position. Besides, when it begin with negative number, you can jump.

Note the two programs is different.