NYOJ171 聪明的kk

原题链接

#include <stdio.h>
#include <algorithm>
using namespace std;
int A[21][21];

int main(){
	int n, m, i, j;
	while(scanf("%d%d", &n, &m) == 2){
		for(i = 1; i <= n; ++i)
			for(j = 1; j <= m; ++j){
				scanf("%d", &A[i][j]);
				A[i][j] += max(A[i][j - 1], A[i - 1][j]);
			}		
		printf("%d\n", A[n][m]);
	}
	return 0;
}