hdoj1024 Max Sum Plus Plus(DP!DP!)

参考的链接http://blog.csdn.net/sdjzping/article/details/8645031

关键还是那两点1.dp[i]的含义2.转移方程怎么写

#include<iostream> #include<math.h>#include<stdio.h>using namespace std;#define M 1000005#define Max 0x7fffffff int a[M],dp[M],mx[M];int maxx(int a,int b){return (a>b)?a:b;}int main(){int m,n,i,j;int max,premax;while(cin>>m>>n){memset(dp,0,sizeof(dp));memset(mx,0,sizeof(mx));for(i=1;i<=n;i++)cin>>a[i];for(i=1;i<=m;i++){premax=-Max;for(j=i;j<=n;j++){dp[j]=maxx((mx[j-1]+a[j]),dp[j-1]+a[j]);mx[j-1]=premax;premax=maxx(premax,dp[j]);}}cout<<premax<<endl;}return 0;}