[BOJ] Game Addiction / silver 2 / 60분

10월/4주차/BOJ_18353_병사 배치하기/ohwootaek_18353_병사배치하기.java

@@ -0,0 +1,56 @@
+import java.io.BufferedReader;
+import java.io.BufferedWriter;
+import java.io.InputStreamReader;
+import java.io.OutputStreamWriter;
+import java.util.Arrays;
+import java.util.StringTokenizer;
+
+public class BOJ_18353_병사배치하기 {
+    static int N, H;
+    static int[] D;
+    static int[] input;
+
+    public static void main(String[] args) throws Exception {
+        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
+        BufferedWriter bw = new BufferedWriter(new OutputStreamWriter(System.out));
+        StringTokenizer st = new StringTokenizer(br.readLine());
+        N = Integer.parseInt(st.nextToken());
+
+        D = new int[N];
+        input = new int[N];
+
+        st = new StringTokenizer(br.readLine());
+        for(int i = 0; i < N; i++) {
+            input[i] = Integer.parseInt(st.nextToken());
+        }
+
+        Arrays.fill(D, 1);
+
+        int ans = 0;
+        for(int i = N - 2; i >= 0; i--) {
+            for(int j = N - 1; j > i; j--) {
+                if(input[i] > input[j]) {
+                    D[i] = Math.max(D[i], D[j] + 1);
+                    //D[i] = input[i];
+                }
+            }
+        }
+
+//		for(int i = 0; i < N; i++) {
+//			bw.write(D[i] + " ");
+//		}
+
+        int max = Integer.MIN_VALUE;
+        for(int i = 0; i < N; i++) {
+            max = Math.max(max, D[i]);
+        }
+
+        ans = N - max;
+
+        bw.write(ans + "\n");
+
+        bw.flush();
+        br.close();
+        bw.close();
+    }
+}

10월/4주차/BOJ_20152_Game Addiction/ohwootaek_20152_gameaddiction.java

@@ -0,0 +1,30 @@
+import java.io.BufferedReader;
+import java.io.InputStreamReader;
+import java.util.StringTokenizer;
+
+public class BOJ_20152_GameAddiction {
+    public static void main(String[] args) throws Exception{
+        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());
+
+        long dp[][] = new long[N + 1][M + 1];
+
+        dp[1][1] = 1;
+
+        for(int i = 1; i <= N; i++){
+            for(int j = 1; j <= M; j++){
+                if(i == 1 && j == 1){
+                    continue;
+                }
+
+                dp[i][j] = (dp[i][j-1] + dp[i-1][j]+ dp[i-1][j-1]) % 1000000007;
+            }
+        }
+
+        System.out.println(dp[N][M]%1000000007);
+
+        br.close();
+    }
+}