Notice
Recent Posts
Recent Comments
Link
| 일 | 월 | 화 | 수 | 목 | 금 | 토 |
|---|---|---|---|---|---|---|
| 1 | 2 | 3 | 4 | 5 | 6 | 7 |
| 8 | 9 | 10 | 11 | 12 | 13 | 14 |
| 15 | 16 | 17 | 18 | 19 | 20 | 21 |
| 22 | 23 | 24 | 25 | 26 | 27 | 28 |
Tags
- ZPL
- Union-Find
- SM36
- Dictionary Search Help
- 날짜 계산 함수
- qfieldname
- APPENDING CORRESPONDING
- Data Browser
- ALV Output Setting
- cfieldname
- DP - 무한배낭
- FOR ALL ENTRIES IN
- transporting
- using value
- java
- DP - 유한배낭
- SAP GUI
- SAP
- 필드카탈로그
- ABAP
- changing value
- batch job
- CTS #CTS 이관 #SAP #ABAP
- boole_d
- READ TABLE
- DP - 무한배낭(순서)
- APPENDING
- NEW-PAGE PRINT ON
- MONAT_F4
- BOJ_Gold
Archives
- Today
- Total
Jin's Library
[Gold Ⅴ] 15486 - 퇴사 2 본문
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.util.StringTokenizer;
public class BOJ_15486 {
public static void main(String[] args) throws Exception{
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
int N = Integer.parseInt(br.readLine());
StringTokenizer st;
int[] day = new int[N];
int[] value = new int[N];
for(int i = 0; i < N; i++){
st = new StringTokenizer(br.readLine());
day[i] = Integer.parseInt(st.nextToken());
value[i] = Integer.parseInt(st.nextToken());
}
long[] dp = new long[N+1];
for(int i = N-1; i>= 0; i--){
int d = day[i];
int v = value[i];
if(i+d <= N){
dp[i] = Math.max(v+dp[i+d], dp[i+1]);
}else{
dp[i] = dp[i+1];
}
}
System.out.println(dp[0]);
}
}'Algorithm - Java > BOJ - Gold' 카테고리의 다른 글
| [Gold Ⅴ] 12865 - 평범한 배낭 (0) | 2025.10.20 |
|---|---|
| [Gold Ⅳ] 2293 - 동전 1 (0) | 2025.10.20 |
| [Gold Ⅴ] 1931 - 회의실 배정 (0) | 2025.10.17 |
| [Gold Ⅳ] 1043 - 거짓말 (0) | 2025.10.02 |
| [Gold Ⅱ] 10775 - 공항 (0) | 2025.10.01 |