Alrarapie

Robot Pengumpul Permen

Dec 5th, 2021 (edited)
489
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
Java 0.70 KB | None | 0 0
  1. import java.util.Scanner;
  2.  
  3. public class Robot_pengumpul_permen {
  4.     public static void main(String[] args) {
  5.         Scanner sc = new Scanner(System.in);
  6.         int n = sc.nextInt();
  7.         int[][] arr = new int[n+1][n+1];
  8.         for (int i = 0; i < arr.length-1; i++) {
  9.             for (int j = 1; j < arr.length; j++) {
  10.                 arr[i][j] = sc.nextInt();
  11.             }
  12.         }
  13.         System.out.println(check(0, n, arr));
  14.     }
  15.    
  16.     public static int check(int n, int m, int[][] arr) {
  17.         if (n == arr.length-1 || m == 0) {
  18.             return 0;
  19.         }
  20.         else {
  21.             return arr[n][m] + Math.max(check(n+1, m, arr), check(n, m-1, arr));
  22.         }
  23.     }
  24. }
  25.  
Add Comment
Please, Sign In to add comment