슈콩

[BOJ] 백준 15486 퇴사 2 본문

Algorithms/Baekjoon

[BOJ] 백준 15486 퇴사 2

shukong 2025. 8. 23. 16:41

[문제]

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

 

 

[소스 코드]

import java.io.*;
import java.util.*;
public class Main {
    public static void main(String[] args) throws IOException {
    	BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
    	StringTokenizer st;
    	int n = Integer.parseInt(br.readLine());
    	int[] T = new int[n+1];
    	int[] P = new int[n+1];
    	for(int i=1;i<=n;i++) {
    		st = new StringTokenizer(br.readLine());
    		T[i] = Integer.parseInt(st.nextToken());
    		P[i] = Integer.parseInt(st.nextToken());
    	}
    	int[] dp = new int[n+2];
    	for(int i=n;i>0;i--) {
    		int end = i + T[i];
    		if(end>n+1) {
    			dp[i] = dp[i+1];
    		}
    		else {
    			dp[i] = Math.max(dp[i+1], P[i] + dp[end]);
    		}
    	}
    	System.out.println(dp[1]);
    }
}