hdu1003 连续最大和

杭电1003

一道动态规划的问题

 

Max Sum

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

Problem Description

Given a sequence a[1],a[2],a[3]......a[n], your job is tocalculate the max sum of a sub-sequence. For example, given (6,-1,5,4,-7), themax sum in this sequence is 6 + (-1) + 5 + 4 = 14.

 

 

Input

The first line of the input contains an integerT(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 integersfollowed(all the integers are between -1000 and 1000).

 

 

Output

For each test case, you should output two lines. The firstline is "Case #:", # means the number of the test case. The secondline contains three integers, the Max Sum in the sequence, the start positionof the sub-sequence, the end position of the sub-sequence. If there are morethan 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

 

解法1：令b[i]表示为输入的n个数。a[i]表示b[]前i个数的和，则a[i]-a[j-1]表示b[j]+…+b[i],我们只需找到最大的max{a[i]-a[j-1]},我们先找到数组a中最小的元素a[min](a[0]=0),然后找某个k，使得a[k]-a[min]最大，即为得到的区间。

Java代码实现：

package hdu.edu.acm;

 

import java.util.Scanner;

 

publicclassProblem1003 {

 

    /**

     * author : luoyang

     * 2013-4-1

     * @param args

     */

    publicstaticvoid main(String[] args) {

        // TODO Auto-generated method stub

 

        int n;

        Scannerinput=newScanner(System.in);

        n=input.nextInt();

        int a[]=newint[1000001];

        for(int k=1;k<=n;k++)

        {

            int m=input.nextInt();

            a[0]=0;

            for(int i=1;i<=m;i++)

            {

                a[i]=a[i-1]+input.nextInt();

                //System.out.println(a[i]);

            }

            int start=0;int end=1;int min=0;int v=a[1];

           

            for(int j=2;j<=m;j++)

            {

                if(a[j-1]<a[min])

                    min=j-1;

                if(a[j]-a[min]>v)

                {

                    v=a[j]-a[min];

                    start=min;

                    end=j;

                }

                   

            }

           

            System.out.printf("Case %d:",k);

            System.out.println();

           

            System.out.printf("%d %d %d",v,start+1,end);

            System.out.println();

            if(k!=n)

                System.out.println();

           

           

        }

    }

 

}

 

 

 

解法2：

参考http://blog.csdn.net/akof1314/article/details/4757021

以下是变量说明：

t               测试数据组数

n               每组数据的长度

temp            当前取的数据

pos1    最后MAX SUM的起始位置

pos2            最后MAX SUM的结束位置

max            当前得到的MAX SUM

now             在读入数据时，能够达到的最大和

x              记录最大和的起始位置，因为不知道跟之前的max值的大小比，所以先存起来

下面模拟过程：

1.首先，读取第一个数据，令now和max等于第一个数据，初始化pos1,pos2,x位置

2.然后，读入第二个数据，判断

①. 若是now+temp<temp，表示当前读入的数据比之前存储的加上当前的还大，说明可以在当前另外开始记录，更新now=temp

②. 反之，则表示之前的数据和在增大，更新now=now+temp

3.之后，把now跟max做比较，更新或者不更新max的值，记录起始、末了位置

4.循环2~3步骤，直至读取数据完毕。

 

 

Java实现：

package hdu.edu.acm;

 

import java.util.Scanner;

 

publicclassProblem1003Way2 {

 

    /**

     * author : luoyang

     * 2013-4-1

     * @param args

     */

    publicstaticvoid main(String[] args) {

        // TODO Auto-generated method stub

        int n;

        Scannerinput=newScanner(System.in);

        n=input.nextInt();

        inttemp,pos1,pos2,max,now,x;

        for(int k=1;k<=n;k++)

        {

            int m=input.nextInt();

            temp=input.nextInt();

            max=now=temp;

            pos1=pos2=x=1;

           

           

            for(int j=2;j<=m;j++)

            {

                temp=input.nextInt();

                if(now+temp<temp)

                {

                    now=temp;

                    x=j;

                }

                else

                    now+=temp;

                if(now>max)

                {

                    max=now;

                    pos1=x;

                    pos2=j;

                }

                   

            }

           

            System.out.printf("Case %d:",k);

            System.out.println();

           

            System.out.printf("%d %d %d",max,pos1,pos2);

            System.out.println();

            if(k!=n)

                System.out.println();

           

           

        }

    }

 

}