80 삐약 : 백준 14501| 퇴사 [바킹독 문제 풀이|DP|JAVA]

https://www.acmicpc.net/problem/14501

 

 

package BKD_0x10_DP;

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.StringTokenizer;

public class BOJ_14501 {
    public static void main(String[] args) throws IOException {
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));

        int N = Integer.parseInt(br.readLine());
        int[] T = new int[16];
        int[] P = new int[16];
        int[] dp = new int[16];

        for(int i=0;i<N;i++){
            StringTokenizer st = new StringTokenizer(br.readLine());
            T[i] = Integer.parseInt(st.nextToken());
            P[i] = Integer.parseInt(st.nextToken());
        }

        for(int i=0;i<N;i++){
            if(i+T[i]<=N){
                dp[i+T[i]] = Math.max(dp[i+T[i]],dp[i]+P[i]);
            }
            dp[i+1] = Math.max(dp[i+1],dp[i]);
        }

        System.out.println(dp[N]);

    }
}

 

참고 url : https://yeons4every.tistory.com/62

백준 14501 : 퇴사 _자바 Java