Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- import java.util.Scanner;
- public class Robot_pengumpul_permen {
- public static void main(String[] args) {
- Scanner sc = new Scanner(System.in);
- int n = sc.nextInt();
- int[][] arr = new int[n+1][n+1];
- for (int i = 0; i < arr.length-1; i++) {
- for (int j = 1; j < arr.length; j++) {
- arr[i][j] = sc.nextInt();
- }
- }
- System.out.println(check(0, n, arr));
- }
- public static int check(int n, int m, int[][] arr) {
- if (n == arr.length-1 || m == 0) {
- return 0;
- }
- else {
- return arr[n][m] + Math.max(check(n+1, m, arr), check(n, m-1, arr));
- }
- }
- }
Add Comment
Please, Sign In to add comment