HDU-2845 DP twice

Problem Description：
Bean-eating is an interesting game, everyone owns an MN matrix, which is filled with different qualities beans. Meantime, there is only one bean in any 11 grid. Now you want to eat the beans and collect the qualities, but everyone must obey by the following rules: if you eat the bean at the coordinate(x, y), you can’t eat the beans anyway at the coordinates listed (if exiting): (x, y-1), (x, y+1), and the both rows whose abscissas are x-1 and x+1.

Input
There are a few cases. In each case, there are two integer M (row number) and N (column number). The next M lines each contain N integers, representing the qualities of the beans. We can make sure that the quality of bean isn’t beyond 1000, and 1<=M*N<=200000.
Output
For each case, you just output the MAX qualities you can eat and then get.

Sample Input
4 6
11 0 7 5 13 9
78 4 81 6 22 4
1 40 9 34 16 10
11 22 0 33 39 6
Sample Output
242
题意：
在图示的条件下(拿了O不能拿—)，求能拿的最大数量
解题思路：
对每行dp一次求其最大值，在拿这些最大值再dp一次
代码：

#include<bits/stdc++.h>
#define maxn 200003
using namespace std;
int dp1[maxn],dp2[maxn];
int main(){
	int m,n;
	while(~scanf("%d%d",&m,&n)){
		for(int i=1;i<=m;++i){
			for(int j=1;j<=n;++j) scanf("%d",&dp1[j]) ,dp1[j]=max(dp1[j-2]+dp1[j],dp1[j-1]);
			dp2[i]=dp1[n];
			dp2[i]=max(dp2[i]+dp2[i-2],dp2[i-1]);
		}
		printf("%d\n",dp2[m]);
	}
	return 0;
}