AcWing 1015. 摘花生(JAVA)
原题链接
简单
作者:
Misaya
,
2021-02-09 10:48:11
,
所有人可见
,
阅读 395
import java.util.*;
class Main{
static int N = 110;
static int T;
static int n,m;
static int[][] w = new int[N][N];
static int[][] f = new int[N][N];
public static void main(String[] args){
Scanner sc = new Scanner(System.in);
T = sc.nextInt();
while(T --> 0){
n = sc.nextInt();
m = sc.nextInt();
for(int i = 1;i<= n;i++){
for(int j =1;j<= m;j++) w[i][j] = sc.nextInt();
}
for(int i = 1;i<= n;i++){
for(int j = 1;j<= m;j++){
f[i][j] = Math.max(f[i-1][j]+w[i][j],f[i][j-1]+w[i][j]);
}
}
System.out.println(f[n][m]);
}
}
}