Merge branch 'week6'

Author: spring0913

week6/BOJ_11660(구간 합 구하기 5).java

@@ -0,0 +1,36 @@
+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 = new StringTokenizer(br.readLine());
+        int N = Integer.parseInt(st.nextToken());
+        int M = Integer.parseInt(st.nextToken());
+        int[][] arr = new int[N + 1][N + 1];
+        for (int i = 1; i <= N; i++) {
+            st = new StringTokenizer(br.readLine());
+            for (int j = 1; j <= N; j++) {
+                arr[i][j] = Integer.parseInt(st.nextToken());
+            }
+        }
+        int[][] d = new int[N + 1][N + 1];
+        for (int i = 1; i <= N; i++) {
+            for (int j = 1; j <= N; j++) {
+                d[i][j] = d[i - 1][j] + d[i][j - 1] - d[i - 1][j - 1] + arr[i][j];
+            }
+        }
+        int x1, y1, x2, y2;
+        StringBuilder sb = new StringBuilder();
+        for (int i = 0; i < M; i++) {
+            st = new StringTokenizer(br.readLine());
+            x1 = Integer.parseInt(st.nextToken());
+            y1 = Integer.parseInt(st.nextToken());
+            x2 = Integer.parseInt(st.nextToken());
+            y2 = Integer.parseInt(st.nextToken());
+            sb.append(d[x2][y2] - d[x2][y1 - 1] - d[x1 - 1][y2] + d[x1 - 1][y1 - 1]).append('\n');
+        }
+        System.out.print(sb);
+    }
+}

week6/BOJ_1495(기타리스트).java

@@ -0,0 +1,41 @@
+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 = new StringTokenizer(br.readLine());
+        int N = Integer.parseInt(st.nextToken());
+        int S = Integer.parseInt(st.nextToken());
+        int M = Integer.parseInt(st.nextToken());
+        int[] volume = new int[N + 1];
+        st = new StringTokenizer(br.readLine());
+        for (int i = 1; i <= N; i++) {
+            volume[i] = Integer.parseInt(st.nextToken());
+        }
+        boolean[][] d = new boolean[N + 1][M + 1];
+        d[0][S] = true;
+        for (int i = 1; i <= N; i++) {
+            for (int vol = 0; vol <= M; vol++) {
+                // 이전에 곡에서 연주 가능한 볼륨일 경우
+                if (d[i - 1][vol]) {
+                    if (vol + volume[i] <= M) {
+                        d[i][vol + volume[i]] = true;
+                    }
+                    if (vol - volume[i] >= 0) {
+                        d[i][vol - volume[i]] = true;
+                    }
+                }
+            }
+        }
+        int answer = -1;
+        for (int i = M; i >= 0; i--) {
+            if (d[N][i]) {
+                answer = i;
+                break;
+            }
+        }
+        System.out.println(answer);
+    }
+}

week6/BOJ_1535(안녕).java

@@ -0,0 +1,29 @@
+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));
+        int N = Integer.parseInt(br.readLine());
+        int[] hp = new int[N + 1];
+        int[] happy = new int[N + 1];
+        int[][] d = new int[N + 1][101];
+        StringTokenizer st1 = new StringTokenizer(br.readLine());
+        StringTokenizer st2 = new StringTokenizer(br.readLine());
+        for (int i = 1; i <= N; i++) {
+            hp[i] = Integer.parseInt(st1.nextToken());
+            happy[i] = Integer.parseInt(st2.nextToken());
+        }
+        for (int i = 1; i <= N; i++) {
+            for (int j = 1; j <= 100; j++) {
+                if (j - hp[i] > 0) {
+                    d[i][j] = Math.max(d[i - 1][j], d[i - 1][j - hp[i]] + happy[i]);
+                } else {
+                    d[i][j] = d[i - 1][j];
+                }
+            }
+        }
+        System.out.println(d[N][100]);
+    }
+}

week6/BOJ_1890(점프).java

@@ -0,0 +1,34 @@
+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));
+        int N = Integer.parseInt(br.readLine());
+        int[][] board = new int[N][N];
+        for (int i = 0; i < N; i++) {
+            StringTokenizer st = new StringTokenizer(br.readLine());
+            for (int j = 0; j < N; j++) {
+                board[i][j] = Integer.parseInt(st.nextToken());
+            }
+        }
+        long[][] d = new long[N][N];
+        d[0][0] = 1;
+        for (int i = 0; i < N; i++) {
+            for (int j = 0; j < N; j++) {
+                int jump = board[i][j];
+                if (jump == 0) {
+                    continue;
+                }
+                if (j + jump < N) {
+                    d[i][j + jump] += d[i][j];
+                }
+                if (i + jump < N) {
+                    d[i + jump][j] += d[i][j];
+                }
+            }
+        }
+        System.out.println(d[N - 1][N - 1]);
+    }
+}

week6/BOJ_1932(정수 삼각형).java

@@ -0,0 +1,28 @@
+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));
+        int n = Integer.parseInt(br.readLine());
+        int[][] arr = new int[n+1][n+1];
+        for(int i=1; i<=n; i++) {
+            StringTokenizer st = new StringTokenizer(br.readLine());
+            for(int j=1; j<=i; j++) {
+                arr[i][j] = Integer.parseInt(st.nextToken());
+            }
+        }
+        int[][] d = new int[n+1][n+1];
+        for(int i=1; i<=n; i++) {
+            for(int j=1; j<=i; j++) {
+                d[i][j] = Math.max(d[i-1][j-1], d[i-1][j]) + arr[i][j];
+            }
+        }
+        int answer = arr[1][1];
+        for(int i=1; i<=n; i++) {
+            answer = Math.max(answer, d[n][i]);
+        }
+        System.out.println(answer);
+    }
+}

week6/BOJ_2502(떡 먹는 호랑이).java

@@ -0,0 +1,27 @@
+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 = new StringTokenizer(br.readLine());
+        int D = Integer.parseInt(st.nextToken());
+        int K = Integer.parseInt(st.nextToken());
+        for(int i=1; i<=K; i++) {
+            int[] d = new int[D+1];
+            d[1] = i;
+            for(int j=i; j<=K; j++) {
+                d[2] = j;
+                for(int k=3; k<=D; k++) {
+                    d[k] = d[k-2] + d[k-1];
+                }
+                if(d[D] == K) {
+                    System.out.println(d[1]);
+                    System.out.println(d[2]);
+                    return;
+                }
+            }
+        }
+    }
+}

week6/BOJ_9465(스티커).java

@@ -0,0 +1,32 @@
+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));
+        int T = Integer.parseInt(br.readLine());
+        for(int tc=0; tc<T; tc++) {
+            int N = Integer.parseInt(br.readLine());
+            int[][] sticker = new int[3][N+1];
+            for(int i=0; i<2; i++) {
+                StringTokenizer st = new StringTokenizer(br.readLine());
+                for(int j=0; j<N; j++) {
+                    sticker[i][j] = Integer.parseInt(st.nextToken());
+                }
+            }
+            // d[0][i] = 윗줄 스티커만 뜯는 경우
+            // d[1][i] = 아랫줄 스티커만 뜯는 경우
+            // d[2][i] = 스티커를 떼지 않는 경우
+            int[][] d = new int[3][N+1];
+            d[0][0] = sticker[0][0];
+            d[1][0] = sticker[1][0];
+            for(int i=1; i<=N; i++) {
+                d[0][i] = Math.max(d[1][i-1], d[2][i-1]) + sticker[0][i];
+                d[1][i] = Math.max(d[0][i-1], d[2][i-1]) + sticker[1][i];
+                d[2][i] = Math.max(d[0][i-1], Math.max(d[1][i-1], d[2][i-1]));
+            }
+            System.out.println(Math.max(d[0][N], d[1][N]));
+        }
+    }
+}