AcWing 1015. 摘花生--Java
原题链接
简单
作者:
Jiang锋时刻
,
2021-02-02 14:20:25
,
所有人可见
,
阅读 280
Java 代码
import java.util.*;
import java.io.*;
public class Main{
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int count = sc.nextInt();
while(count-- > 0) {
int row = sc.nextInt();
int col = sc.nextInt();
int[][] arr = new int[row][col];
for(int i = 0; i < row; i++) {
for(int j = 0; j < col; j++) {
arr[i][j] = sc.nextInt();
int temp = 0;
if(i - 1 >= 0) {
temp = Math.max(temp, arr[i- 1][j]);
}
if(j - 1 >= 0) {
temp = Math.max(temp, arr[i][j - 1]);
}
arr[i][j] += temp;
}
}
System.out.println(arr[row - 1][col - 1]);
}
}
}