http://acm.hdu.edu.cn/showproblem.php?pid=2845&&最大不连续数和

原创 2012年03月26日 09:37:19

Beans

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


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
题意:最大不连续和问题,如果选中(x,y),那么x-1和x+1行不能选,(x,y-1)和(x,y+1)也不能选,,,状态转移方程
b[i]=max(b[i-2]+b[i],b[i-1])
AC代码:
#include<iostream>
#include<string.h>
#include<string>
#include<algorithm>
#define N 200005
using namespace std;
int a[N],b[N];
int main()
{
  int n,m;
  while(cin>>n>>m)
  {  memset(b,0,sizeof(b));
      for(int i=1;i<=n;++i)
         {
             for(int j=1;j<=m;++j)
               cin>>b[j];
              for(int j=2;j<=m;++j)
              b[j]=max(b[j-2]+b[j],b[j-1]);
              a[i]=b[m];
          }
      for(int i=2;i<=n;++i)
          a[i]=max(a[i-2]+a[i],a[i-1]);
      cout<<a[n]<<endl;
  }return 0;
}



完数 &&http://acm.hdu.edu.cn/showproblem.php?pid=1406

求10000以内的完数,打表即可。。。 AC代码: #include #include #include #include #include #define N 10005 using nam...

http://acm.hdu.edu.cn/showproblem.php?pid=2066&&多源多点

Problem Description 虽然草儿是个路痴(就是在杭电待了一年多,居然还会在校园里迷路的人,汗~),但是草儿仍然很喜欢旅行,因为在旅途中 会遇见很多人(白马王子,^0^),很多事,还能...

http://acm.hdu.edu.cn/showproblem.php?pid=1166&&线段树区间求和

这两天写几道线段树题,意外发现建树的过程其实就是先序的过程,如果写的是动态的话,删除结点的过程就是后序的过程。。 #include #include #include #include #defin...

http://acm.hdu.edu.cn/showproblem.php?pid=2680&&Choose the best route

有向图的最短路问题,坑爹啊,,用无向图代码提交后WA了n次后,又仔细看了一遍题,原来是有向图,杯具啊。。。 还有一点需要注意的是,由于要逆向思维,图要反着存,,切记,,, AC代码: #incl...

Quoit Design&&http://acm.hdu.edu.cn/showproblem.php?pid=1007

求最近点对,模板题。。。。采用的是分治的思想。http://blog.csdn.net/smallacmer/article/details/7763407 Problem Descri...

http://acm.hdu.edu.cn/showproblem.php?pid=1892&&二维树状数组

二维树状数组,,,,今天长见识了。。。 这一题题意:对一个矩形框的书进行,插入,挪动,删除。。。。 #include #include #include #include using na...

http://acm.hdu.edu.cn/showproblem.php?pid=3790&&最短路径问题

Problem Description 给你n个点,m条无向边,每条边都有长度d和花费p,给你起点s终点t,要求输出起点到终点的最短距离及其花费,如果最短距离有多条路线,则输出花费最少的。 ...

http://acm.hdu.edu.cn/showproblem.php?pid=1754&&线段树区间求最值

I Hate It Time Limit: 9000/3000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total S...

http://acm.hdu.edu.cn/showproblem.php?pid=3836

强连通分量tarjan算法+缩点。。。 需要注意的一点就是当给定的图本身就是个强连通图时直接输出0即可。。。 #include #include #include #include #defi...

http://acm.hdu.edu.cn/showproblem.php?pid=1172

猜数字 Time Limit: 20000/10000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submi...
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:http://acm.hdu.edu.cn/showproblem.php?pid=2845&&最大不连续数和
举报原因:
原因补充:

(最多只允许输入30个字)