hdu 2845
#include<stdio.h>
#define N 200100
int f[N];
int  a[N],n;
int main() {
int m,j,i,suma,sumb,sumc,sumd;
while(scanf("%d%d",&m,&n)!=EOF) {
       for(i=1;i<=m;i++)
  for(j=1;j<=n;j++)
  scanf("%d",&f[(i-1)*n+j]);
  for(i=1;i<=m;i++) {
  suma=sumb=sumc=sumd=0;
  for(j=1;j<=n;j++) {
  sumd=sumc;
  if(suma>sumb)
  sumc=suma+f[(i-1)*n+j];
  else
  sumc=sumb+f[(i-1)*n+j];
  suma=sumb;
 sumb=sumd;
  }
  a[i]=sumc>sumb?sumc:sumb;
  }
  suma=sumb=sumc=sumd=0;
  for(i=1;i<=m;i++) {
  sumd=sumc;
  if(suma>sumb)
  sumc=suma+a[i];
  else
  sumc=sumb+a[i];
  suma=sumb;
  sumb=sumd;
  }
  printf("%d\n",sumc>sumb?sumc:sumb);
}
return 0;
}
hdu 2845的更多相关文章
- HDU 2845 Beans (DP)
		Beans Time Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64u Submit Status ... 
- HDU 2845 Beans (两次线性dp)
		Beans Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Subm ... 
- HDU 2845 Beans (动态调节)
		Beans Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Subm ... 
- HDU 2845 Beans(dp)
		Problem Description Bean-eating is an interesting game, everyone owns an M*N matrix, which is filled ... 
- Hdu 2845 Beans
		Beans Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submi ... 
- hdu 2845(dp基础题)
		题意:容易理解. 分析:以后碰到这种类型的题,就要考虑把矩阵先按行来处理,再按列处理.先算出每行能够能够得到的最大值,然后按列处理即可. 代码实现: #include<stdio.h> # ... 
- HDU 2845 Beans (DP)
		Problem Description Bean-eating is an interesting game, everyone owns an M*N matrix, which is filled ... 
- hdu 2845 Beans(最大不连续子序列和)
		Problem Description Bean-eating is an interesting game, everyone owns an M*N matrix, which is filled ... 
- hdu 2845 Beans                                                                                            2016-09-12 17:17             23人阅读              评论(0)              收藏
		Beans Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Subm ... 
- hdu 2845——Beans——————【dp】
		Beans Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submi ... 
随机推荐
- 爬虫中动态的POST参数
			爬虫的过程中,有的网站提交POST数据时候每次都会带上不懂POST参数,要想爬到数据首先的知道怎么构造这些动态的参数. 1.分析提交POST数据的最原始网页,分析原始网页的源代码,查找里面是否包含有你 ... 
- poj1815Friendship(最小割求割边)
			链接 题意为去掉多少个顶点使图不连通,求顶点连通度问题.拆点,构造图,对于<u,v>可以变成<u2,v1> <v2,u1>容量为无穷,<u1,u2>容量 ... 
- C# winform 创建快捷方式
			using System;using IWshRuntimeLibrary;using System.IO; namespace UavSystem.Common{ public class S ... 
- 使用ant build build.xml报“includeantruntime was not set”警告及"Class not found: javac1.8"问题
			问题1:ant编译build.xml报“includeantruntime was not set”警告. 警告详情: warning: 'includeantruntime' was not set ... 
- KendoUI Grid Pager部分 Nan-Nan of x Items
			相关问题: http://stackoverflow.com/questions/23941065/pager-error-in-kendo-gridnan-nan-of-1-items http:/ ... 
- LibreOJ #101. 最大流
			题目描述 这是一道模板题. 给定 n nn 个点,m mm 条边,给定每条边的容量,求从点 s ss 到点 t tt 的最大流. 输入格式 第一行四个整数 n nn.m mm.s ss.t tt.接下 ... 
- SQLite -附加数据库
			SQLite -附加数据库 考虑情况下当你有多个数据库可用,您希望使用其中任何一个.SQLite附加DTABASE语句用于选择一个特定的数据库,这个命令之后,所有SQLite语句将执行以下附加数据库. ... 
- VC++绘制金刚石(MFC)
			void CTxx1View::OnDraw(CDC* pDC){ CTxx1Doc* pDoc = GetDocument(); ASSERT_VALID(pDoc); // TODO: add d ... 
- 汇编4OPCODE
			opcode原理 前缀域 切换操作数大小前缀 : 066h 可以将32位的操作数切换成16位的操作数 B8 00010000 | MOV EAX,0x100 66:B8 0001 | MOV ... 
- linux ABORT的应用详解
			NAME ABORT - 退出当前事务 SYNOPSIS ABORT [ WORK | TRANSACTION ] DESCRIPTION 描述 ABORT 回卷当前事务并且废弃所有当前事务中做的更新 ... 
