HDOJ1003

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 case s.

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

采用动态规划的方法是普遍的做法： 即求最大子序列，状态转移方程为：m[left][right]=m[left][right-1]+m[right][right]；

附上代码：

#include <stdio.h>
#include <stdlib.h>
int b=1;
int m[100][100],a[1000];
int main() {
    void dp(int *g,int w);
    void input(int *g,int n);
	int n,w;
	scanf("%d",&n);
    int *g;
    while(n--)
    {
        g=a;
        scanf("%d",&w);
        input(g,w);
        g=a;
	    dp(g,w);
    }
	return 0;
}

void input(int *g,int n)
{
    while(n--)
    {
        scanf("%d",g++);
    }
}
void dp(int *g,int w)
{
    int left,right,i,k,max=-1000,ml,mr;
        for(i=0;i<w;i++){
            left=right=i;
            m[left][right]=*(g++);
            if(m[left][right]>max){
                    max=m[left][right];
                    ml=left+1;
                    mr=right+1;
            }
        }
        for(k=1;k<w;k++){
            for(i=0;i<w-k;i++){
                left=i;
                right=left+k;

                m[left][right]=m[left][right-1]+m[right][right];
                if(m[left][right]>=max){
                    max=m[left][right];
                    ml=left+1;
                    mr=right+1;

                }
            }
        }
        printf("Case %d:\n%d %d %d\n",b,max,ml,mr);
        b++;
}