HDOJ 题目2845Beans（动态规划）



Beans

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 2870    Accepted Submission(s): 1391

Problem Description

Bean-eating is an interesting game, everyone owns an M*N matrix, which is filled with different qualities beans. Meantime, there is only one bean in any 1*1 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.


Now, how much qualities can you eat and then get ?

 

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
  
  

 

Source

2009 Multi-University Training Contest 4 - Host by HDU

 

Recommend

gaojie   |   We have carefully selected several similar problems for you:   2830  2577  2870  1159  2844 

 

题目大意：对于同一行来说，相邻的数不能同时取，对于同一列来说，相邻的列不可以同时取

ac代码

#include<stdio.h>
#include<string.h>
int maxx(int a,int b)
{
	if(a>b)
		return a;
	else
		return b;
}
int a[20005],b[200005],dp[200005];
int main()
{
	int n,m,i,j;
	while(scanf("%d%d",&n,&m)!=EOF)
	{
		memset(a,0,sizeof(a));
		memset(b,0,sizeof(b));
		memset(dp,0,sizeof(dp));
		for(i=1;i<=n;i++)
		{
			for(j=1;j<=m;j++)
				scanf("%d",&a[j]);
			//dp[1]=a[1];
			for(j=1;j<=m;j++)
			{
				dp[j]=maxx(dp[j-2]+a[j],dp[j-1]);
			}
			b[i]=dp[m];
		}
		for(i=1;i<=n;i++)
			dp[i]=maxx(dp[i-2]+b[i],dp[i-1]);
		printf("%d\n",dp[n]);
	}
}