ABOUT ME

-

Today
-
Yesterday
-
Total
-
  • 퇴사
    백준알고리즘 2019. 7. 21. 03:30
    import java.util.Scanner;
    
    public class Main {
        static int k = Integer.MIN_VALUE;
        static void go(int n,int[] t , int[] p,int day, int pay){
            if(day == n ){
                if(pay > k) k = pay;
                return;
            }
            if(day > n) return;
            go(n,t,p,day+t[day], pay+p[day]);
            go(n,t,p,day + 1 , pay);
        }
        public static void main(String[] args){
            Scanner sc = new Scanner(System.in);
    
            int n = sc.nextInt();
            int[] t = new int[n];
            int[] p = new int[n];
            for(int i = 0; i < n; i++){
                t[i] = sc.nextInt();
                p[i] = sc.nextInt();
            }
            go(n,t,p,0,0);
            System.out.println(k);
        }
    }
    

    DP

    '백준알고리즘' 카테고리의 다른 글

    잉카달력  (0) 2019.07.21
    리모컨  (0) 2019.07.21
    테트로미노  (0) 2019.07.21
    안전영역  (0) 2019.07.20
    인구 이동  (0) 2019.07.17

    댓글

Designed by Tistory.