java滚动数组_HDU--1024-Max Sum Plus Plus(最大M子段和+滚动数组优化)

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 S1, S2, S3, S4... Sx, ... Sn(1 ≤ x ≤ n ≤ 1,000,000, -32768 ≤ Sx≤ 32767). We define a function sum(i, j) = Si+ ... + Sj(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(i1, j1) + sum(i2, j2) + sum(i3, j3) + ... + sum(im, jm) maximal (ix≤ iy≤ jxor ix≤ jy≤ jxis 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(ix, jx)(1 ≤ x ≤ m) instead. ^_^

Input

Each test case will begin with two integers m and n, followed by n integers S1, S2, S3... Sn.Process to the end of file.

Output

Output the maximal summation described above in one line.

Sample Input1 3 1 2 3

2 6 -1 4 -2 3 -2 3

Sample Output6

8

Hint

Huge input, scanf and dynamic programming is recommended.

题意：输入一个n，m分别表示成n组，一共有m个数。即：将m个数分成n组，n组的全部数加起来的和，得到最大值并输出。

如： n=2  m=6序列：-1 4 -2 3 -2 3 ,最大值为-1 4 -2 3 -2 3，划线部分为分组情况，最大值为：8.

题解：

状态 dp[i][j]表示前 j个数分成 i组的最大值。

动态转移方程：dp[i][j]=max(dp[i][j-1],max(dp[i-1][k]))+a[j](i-1 <=  k <= j-1)

1. dp[i][j-1]+a[j]表示的是前j-1分成i组，第j个必须放在前一组里面。

2.max( dp[i-1][k] ) + a[j] )表示的前(i-1 <=  k <= j-1)分成i-1组，第j个单独分成一组。for(int i=1;i<=n;i++)//第i组

{

for(int j=i;j<=m;j++)//第j个人

{

temp=-inf;

for(int k=i-1;k<=j-1;k++)//找最大值

{

temp=max(dp[i-1][k],temp);

}

d[i][j]=max(d[i][j-1],temp)+num[j];//取最大值

}

}

但是题目的数据量比较大，时间复杂度为n^3，n<=1000000，显然会超时，继续优化。

max( dp[i-1][k] ) 就是上一组 i-1....j-1 的最大值。我们可以在每次计算dp[i][j]的时候记录下前j个

的最大值 用数组保存下来 ，这样时间复杂度为 n^2。

#include

#include

#include

#include

#include

#include

#include

#include

#include

#include

#include

#define inf 0x3f3f3f3f

#define ll long long

#define sscc ios::sync_with_stdio(false);

#define ms(a) memset(a,0,sizeof(a))

#define mss(a) memset(a,-1,sizeof(a))

#define msi(a) memset(a,inf,sizeof(a))

using namespace std;

const int M=1000008;

int a[M];

int dp[M];

int ma[M];

int main(){

sscc;

int n,m,temp;

while(cin>>n>>m)

{

ms(dp),ms(ma);

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

cin>>a[i];

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

{

temp=-inf;

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

{

dp[j]=max(dp[j-1],ma[j-1])+a[j];

ma[j-1]=temp;

temp=max(temp,dp[j]);

}

}

cout<

}

return 0;

}