HDU-1024 java 实现

Max Sum Plus Plus

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

Problem Description

Now I think you have got an AC in Ignatius.L's "Max Sum" problem. To be a brave ACMer, we always challenge ourselves to more difficult problems. Now you are faced with a more difficult problem.

Given a consecutive number sequence S ₁, S ₂, S ₃, S ₄ ... S _x, ... S _n (1 ≤ x ≤ n ≤ 1,000,000, -32768 ≤ S _x ≤ 32767). We define a function sum(i, j) = S _i + ... + S _j (1 ≤ i ≤ j ≤ n).

Now given an integer m (m > 0), your task is to find m pairs of i and j which make sum(i ₁, j ₁) + sum(i ₂, j ₂) + sum(i ₃, j ₃) + ... + sum(i _m, j _m) maximal (i _x ≤ i _y ≤ j _x or i _x ≤ j _y ≤ j _x is not allowed).

But I`m lazy, I don't want to write a special-judge module, so you don't have to output m pairs of i and j, just output the maximal summation of sum(i _x, j _x)(1 ≤ x ≤ m) instead. ^_^

 

Input

Each test case will begin with two integers m and n, followed by n integers S ₁, S ₂, S ₃ ... S _n.
Process to the end of file.

 

Output

Output the maximal summation described above in one line.

 

Sample Input

1 3 1 2 32 6 -1 4 -2 3 -2 3

 

Sample Output

68

最大M子段和，求一个数组中分成M段取数，最大的和是多少。

import java.util.Scanner;
public class pro1024 {
	public static void main(String[] args) {
		// TODO 自动生成的方法存根
      Scanner cin=new Scanner(System.in);
      while(cin.hasNext())
      {
    	  int m=cin.nextInt();
    	  int n=cin.nextInt();
    	  int []num=new int[n+1];
    	  int dp[]=new int[n+1];
    	  for(int i=1;i<=n;i++)
    	  {  
    		  num[i]=cin.nextInt();
    	  }
    	 int mmmax=-2100000000;
    	  int jmax[]=new int [n+1];  
    	  for(int i=1;i<=m;i++)
    	  {
    		  mmmax=-2100000000;
    		  for(int j=i;j<=n;j++)
    		  {
    			  dp[j]=Math.max(dp[j-1]+num[j], jmax[j-1]+num[j]);			
                  jmax[j-1]=mmmax;
                  mmmax=Math.max(mmmax, dp[j]);
    		  }
    	  }
    	  System.out.println(mmmax);
      }
	}

}

核心代码来自于http://blog.csdn.net/youchengyuanzhi/article/details/8875354