Skip to content

Commit 7955ca6

Browse files
committed
1116
1 parent 2cebb6c commit 7955ca6

File tree

2 files changed

+27
-23
lines changed

2 files changed

+27
-23
lines changed

BOJ/silver/BOJ10974/src/Main.java

Lines changed: 7 additions & 9 deletions
Original file line numberDiff line numberDiff line change
@@ -12,17 +12,15 @@ public static void main(String[] args) {
1212
perm(N, visited, num, 0);
1313
}
1414

15-
private static void perm(int n, int [] visited, int [] num, int r) {
16-
if(n==r){
17-
StringBuilder sb =new StringBuilder();
15+
private static void perm(int n, int[] visited, int[] num, int r) {
16+
if(r==n){
17+
StringBuilder sb = new StringBuilder();
18+
1819
for (int i = 0; i < num.length; i++) {
19-
sb.append(num[i]+" ");
20+
sb.append(num[i]).append(" ");
2021
}
21-
System.out.println(sb.toString());
22-
23-
return;
22+
System.out.println(sb);
2423
}
25-
2624
for (int i = 0; i < n; i++) {
2725
if(visited[i]==0){
2826
visited[i]=1;
@@ -31,7 +29,7 @@ private static void perm(int n, int [] visited, int [] num, int r) {
3129
visited[i]=0;
3230
}
3331

34-
3532
}
3633
}
34+
3735
}

BOJ/silver/BOj14501/src/Main.java

Lines changed: 20 additions & 14 deletions
Original file line numberDiff line numberDiff line change
@@ -1,30 +1,36 @@
11
import java.io.BufferedReader;
22
import java.io.IOException;
33
import java.io.InputStreamReader;
4+
import java.util.StringTokenizer;
45

56

67
public class Main {
78
public static void main(String[] args) throws IOException {
89
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
10+
int n = Integer.parseInt(br.readLine());
11+
StringTokenizer st;
12+
int[] period = new int[n];
13+
int[] cost = new int[n];
14+
for (int i = 0; i < n; i++) {
15+
st = new StringTokenizer(br.readLine());
16+
int t = Integer.parseInt(st.nextToken());
17+
int p = Integer.parseInt(st.nextToken());
18+
period[i] = t;
19+
cost[i] = p;
20+
}
21+
int [] dp = new int[n+2];
22+
for (int i = 0; i < n; i++) {
23+
if(period[i]+i<=n+1){
24+
dp[period[i]+i]=Math.max(dp[period[i]+i], dp[i]+cost[i]);
925

26+
}
27+
dp[i+1]=Math.max(dp[i],dp[i+1]);
28+
}
29+
System.out.println(dp[n]);
1030

11-
int N = Integer.parseInt(br.readLine());
12-
int [] dp =new int [N+2];
13-
int [] T = new int [N+1];
14-
int [] P =new int [N+1];
1531

16-
for (int i = 0; i < N; i++) {
17-
String [] tmp= br.readLine().split(" ");
18-
int t = Integer.parseInt(tmp[0]);
19-
int p = Integer.parseInt(tmp[1]);
2032

21-
if(t+i<=N+1){
22-
dp[i+t]=Math.max(dp[i]+p, dp[i+t]);
23-
}
24-
dp[i+1]=Math.max(dp[i+1],dp[i]);
2533

26-
}
27-
System.out.println(dp[N]);
2834

2935
}
3036
}

0 commit comments

Comments
 (0)