swustoj 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
输出
5

思路：用我蹩脚的英语翻译过来就是，一个机器人在这个二维数组捡硬币，只能向右或者向下走，论如何捡到最多的硬币。
很典型的一道动态规划的题目，开一个dp的二维数组来记录走到第i行第j列捡到硬币的最大数。初始条件就是在第1行第1列（n和m都从1开始的）的时候捡到的硬币数，就等于map[1][1]的硬币数；因为机器人只能从左边或者上边走过来，那么转移方程就是dp[i][j]=max(dp[i-1][j],dp[i][j-1])+map[i][j]；结束条件就是走到第n行第m列啦。

#include<iostream>
using namespace std;

int n,m;//n行m列
int map[1001][1001];//地图
int dp[1001][1001];//记录走到第i行第j列捡到最多的硬币数

int main(){
	cin>>n>>m;
	for(int i=1;i<=n;++i){//下标都从1开始的
		for(int j=1;j<=m;++j){
			cin>>map[i][j];
		}
	}
	dp[1][1]=map[1][1];//初始化
	for(int i=1;i<=n;++i){
		for(int j=1;j<=m;++j){
			dp[i][j]=max(dp[i-1][j],dp[i][j-1])+map[i][j];//转移方程
		}
	}
	cout<<dp[n][m]<<endl;//到第n行第m列的硬币数
	return 0;
}