hdu-2845-Beans 最大不连续子序列和

最新推荐文章于 2019-07-23 18:05:00 发布

坤坤爱技术~

最新推荐文章于 2019-07-23 18:05:00 发布

阅读量591

点赞数

分类专栏：算法与数据结构

本文链接：https://blog.csdn.net/qq_36914923/article/details/80096069

版权

算法与数据结构专栏收录该内容

132 篇文章 0 订阅

订阅专栏

Beans

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

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

求两边最大不连续子序列和

#include<stdio.h>
#include<algorithm>
using namespace std;
int a[200002],sum[200002];
int main()
{
	int n,m,b;
	while(~scanf("%d%d",&n,&m))
	{
		for(int i=1;i<=n;i++)
		{
			scanf("%d",&a[1]);
			for(int j=2;j<=m;j++)
			{
				scanf("%d",&b);
				a[j]=max(a[j-2]+b,a[j-1]);//从第二个开始算 
			}
			sum[i]=a[m]; 
		}
		for(int i=2;i<=n;i++)
		{
			sum[i]=max(sum[i-2]+sum[i],sum[i-1]);
		}
		printf("%d\n",sum[n]);
	}
	return 0;
}