알고리즘 & 자료구조569 백준 1253 import java.io.BufferedReader; import java.io.IOException; import java.io.InputStreamReader; import java.util.Arrays; import java.util.StringTokenizer; class Main { static int N; static int[] A; public static void main(String[] args) throws Exception { input(); go(); } private static boolean check(int target_idx) { int L = 1, R = N; int target = A[target_idx]; while (L < R) { if (L == target_idx.. 2022. 9. 12. 백준 13144 package baekjoon.투포인터; import java.util.*; import java.io.*; class Main13144 { static int N; static int[] A, C; public static void main(String[] args) throws Exception { input(); go(); } private static void go() { long ans = 0; for (int L = 1, R = 0; L 2022. 9. 12. 백준 2470 V2 package baekjoon.투포인터; import java.io.BufferedReader; import java.io.IOException; import java.io.InputStreamReader; import java.util.Arrays; import java.util.StringTokenizer; class Main2470V2 { static int N; static int[] A; static StringBuilder sb = new StringBuilder(); private static void go() { int best_sum = Integer.MAX_VALUE; int v1 = 0, v2 = 0, L = 1, R = N; while (L < R) { int sum = A[L] +.. 2022. 9. 12. 백준 1806 package baekjoon.투포인터; import java.io.BufferedReader; import java.io.IOException; import java.io.InputStreamReader; import java.util.StringTokenizer; class Main1806 { static int S, N; static int[] A; private static void go() { int R = 0, sum = 0, ans = N + 1; for (int L = 1; L 2022. 9. 12. 백준 2110 package baekjoon.이분탐색; import java.io.BufferedReader; import java.io.IOException; import java.io.InputStreamReader; import java.util.Arrays; import java.util.StringTokenizer; class Main2110 { static int N, C; static int[] A; private static boolean determination(int D) { int cnt = 1, last = A[1]; for (int i = 2; i = D) { cnt++; last = A[i]; } } return cnt >= C; } private static void go() { int L .. 2022. 9. 11. 백준 2805 package baekjoon.이분탐색; import java.io.BufferedReader; import java.io.IOException; import java.io.InputStreamReader; import java.util.Arrays; import java.util.StringTokenizer; class Main2805 { static int N, M; static int[] h; private static boolean determination(int H) { long sum = 0; for (int i = 1; i H) { sum += h[i] - H; } } return sum >= M; } private static void go() { long L = 0, R = 2_000_0.. 2022. 9. 11. 이전 1 ··· 29 30 31 32 33 34 35 ··· 95 다음