SWUST OJ 1132: Coin-collecting by robot

题目描述

Several coins are placed in cells of an n×m board. A robot, located in the upper left cell of the board, needs to collect as many of the coins as possible and bring them to the bottom right cell. On each step, the robot can move either one cell to the right or one cell down from its current location.

输入

The fist line is n,m, which 1< = n,m <= 1000.
Then, have n row and m col, which has a coin in cell, the cell number is 1, otherwise is 0.

输出

The max number Coin-collecting by robot.

样例输入

5 6
0 0 0 0 1 0
0 1 0 1 0 0
0 0 0 1 0 1
0 0 1 0 0 1
1 0 0 0 1 0

样例输出

#include<iostream>
#include<stdio.h>
#include<string.h>
using namespace std;
///计算最大值
int Max(int a,int b)
{return a>b?a:b;
}
int arr[1001][1001];
void Maxvalue(int n,int m)
{for(int i=1;i<=n;i++){for(int j=1;j<=m;j++)arr[i][j]=Max(arr[i-1][j],arr[i][j-1])+arr[i][j];}
}
int main()
{memset(arr,0,sizeof(arr));int n,m;cin>>n>>m;for(int i=1;i<=n;i++){for(int j=1;j<m;j++){scanf("%d", &arr[i][j]);}}Maxvalue(n,m);printf("%d\n",arr[n][m]);return 0;
}

SWUST OJ 1132: Coin-collecting by robot相关推荐

[Swust OJ 404]--最小代价树(动态规划)
题目链接:http://acm.swust.edu.cn/problem/code/745255/ Time limit(ms): 1000 Memory limit(kb): 65535 Descr ...
SWUST OJ 954单链表的链接
swust oj 954 题目描述建立长度为n的单链表A和长度为m的单链表B.编程实现将B表链接在A表的尾端,形成一个单链表A.数据类型指定为字符型. 输入输出样例输入样例输出源代码 #in ...
swust oj#160促销计算
SWUST OJ#160 题目描述某百货公司为了促销,采用购物打折的优惠方法,每位顾客一次购物:在1000元以上者,按9.5折优惠:在2000以上者,按9折优惠:在3000以上者,按8.5折优惠:在 ...
SWUST OJ 1168 喝可乐
swust oj 1168 题目描述小明十分喜欢喝可乐,有一次店家搞促销,用三个可乐瓶盖便可换一瓶新可乐.现在告诉你小明身上的钱和每瓶可乐的单价,问你小明最多可以喝多少瓶可乐?(不能向老板借瓶盖) ...
swust oj代码+解析_1165,0284,0074,0042,1171,0026,0189,0078,0046,0077，0209，0129
swust oj 1165,0284(int a［n]\数字根),0074,0042,1171(矩阵相乘输出对齐),0026/0189,0078(计算生日是星期几),0046,0077(计算员工周工 ...
SWUST OJ#281逃跑的蠕虫
swust oj 281 题目描述装在瓶子(瓶子高度为h)的蠕虫都想从瓶子底部向瓶口处爬出去.它每分钟向上爬行u厘米,之后会休息一分钟,这一分钟它会向下滑行d厘米,当蠕虫到了瓶口或者超出瓶口后便出了 ...
SWUST OJ#978 #979 #980 二叉树的遍历
目录深度优先遍历输出利用先序遍历创建的二叉树的前序遍历序列思路代码 #978 输出利用先序遍历创建的二叉树的中序遍历序列题目思路代码 #979 输出利用先序遍历创建的二叉树的后序遍历序列 ...
SWUST OJ 1159 吃披萨
swust oj 1159 题目描述小明楼下新开了两家披萨店,价格都一样,不同的是A家披萨店的披萨是圆形,B家披萨店的披萨是三角形.为了知道哪家披萨店的披萨面积更大一些,于是就找到你咯,你来帮帮他 ...
c语言swustoj括号匹配问题,swust oj 962
括号匹配问题 1000(ms) 65535(kb) 3045 / 13375 假设表达式中允许包含两种括号:圆括号和方括号.编写一个算法判断表达式中的括号是否正确配对. 输入由括号构成的字符串,包含 ...
[Swust OJ 1026]--Egg pain's hzf
题目链接:http://acm.swust.edu.cn/problem/1026/ Time limit(ms): 3000 Memory limit(kb): 65535 hzf is crazy ...

SWUST OJ 1132: Coin-collecting by robot

SWUST OJ 1132: Coin-collecting by robot相关推荐

最新文章

热门文章