摘花生 http://bailian.openjudge.cn/summeracm2014final/L/
2016-01-07 01:18
537 查看
动态规划简单题目
#include<stdio.h>
int t,a[101][101];
int main(){
int i,j,n,m;
scanf("%d",&t);
while(t--){
scanf("%d%d",&n,&m);
for(i=1;i<=n;i++){
for(j=1;j<=m;j++){
scanf("%d",&a[i][j]);
}
}
for(i=0;i<=n;i++)
a[i][0]=0;
for(j=0;j<=m;j++)
a[0][j]=0;
for(i=1;i<=n;i++){
for(j=1;j<=m;j++){
if(a[i][j-1]<a[i-1][j])
a[i][j]+=a[i-1][j];
else if(a[i][j-1]>a[i-1][j])
a[i][j]+=a[i][j-1];
else
a[i][j]+=a[i][j-1];
}
}
printf("%d\n",a
[m]);
}
return 0;
}
#include<stdio.h>
int t,a[101][101];
int main(){
int i,j,n,m;
scanf("%d",&t);
while(t--){
scanf("%d%d",&n,&m);
for(i=1;i<=n;i++){
for(j=1;j<=m;j++){
scanf("%d",&a[i][j]);
}
}
for(i=0;i<=n;i++)
a[i][0]=0;
for(j=0;j<=m;j++)
a[0][j]=0;
for(i=1;i<=n;i++){
for(j=1;j<=m;j++){
if(a[i][j-1]<a[i-1][j])
a[i][j]+=a[i-1][j];
else if(a[i][j-1]>a[i-1][j])
a[i][j]+=a[i][j-1];
else
a[i][j]+=a[i][j-1];
}
}
printf("%d\n",a
[m]);
}
return 0;
}
相关文章推荐
- POJ 2010 Moo University - Financial Aid(优先队列or二分搜索—最大化K大值)
- rails手脚架(scaffold)功能
- Failed to set permissions of path
- MFC的OnPaint工作原理
- cout输出字符串地址 http://cache.baiducontent.com/c?m=9f65cb4a8c8507ed4fece7631049c0666e04de3e69c0d0622e95
- Sicily 1692. Cover Constraints
- [Andrid转]新版安卓SDK文件activity_main.xml和fragment_main.xml的处理
- Daily Scrum – 1/6
- http://blog.csdn.net/zhang_xinxiu/article/details/38655311
- NSBundle 的理解和 mainBundle 类方法详解,nsbundlemainbundle
- 70. Climbing Stairs
- List的contains()方法(转)
- 解决: Fail to create empty document
- LoadRunner运行场景,错误---Error: Failed to send data by channels - post message failed.
- Sicily 1741. Jaunt around the Zhuhai Campus
- 新手安装cocoapods OSX EI captain
- canvas中paint画圆时strokewidth和radius的关系
- sencha touch编译报错:“bfailed to create task or type x-compass-compile Cause: The name is undefined”
- 算法杂货铺——分类算法之朴素贝叶斯分类(Naive Bayesian classification)
- 服务器最大连接数“server reached MaxClients setting,consider raising the Max Clients setting”