HDU 2845 Beans

Dp.

DP processes the maximum value each row can get, and then the DP chooses which lines to get the maximum value.

The essence of row and column selection is the same operation.

#include <cstdio>#include<cstring>#include<cmath>#include<algorithm>using namespacestd;Const intmaxn=200000+Ten;intn,m;Long Longa[maxn],f[maxn],dp[maxn][2];Long LongB[MAXN];Long LongWorkintLen) {    Long Longres=0; dp[0][0]=dp[0][1]=0;  for(intI=1; i<=len;i++) {dp[i][0]=max (dp[i-1][1],dp[i-1][0]); dp[i][1]=dp[i-1][0]+B[i]; Res=max (Res,max (dp[i][0],dp[i][1])); }    returnRes;}intMain () { while(~SCANF ("%d%d",&n,&m)) { for(intI=1; i<=n*m; i++) scanf ("%lld",&A[i]); intCnt=0, hang=1;  for(intI=1; i<=n*m;i++) {b[++cnt]=A[i]; if(cnt==m) {F[hang++]=Work (m); CNT=0; }        }         for(intI=1; i<=n;i++) b[i]=F[i]; printf ("%lld\n", Work (n)); }    return 0;}

HDU 2845 Beans