DEVKDH

[백준] 1074번 : Z[Java]

#풀이import java.io.*;import java.util.StringTokenizer;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,r,c; N = Integer.parseInt(st.nextToken()); r = Integer.parseInt(st.nextToken()); c..

[백준] 11000번 : 강의실 배정[Java]

#풀이import java.io.*;import java.util.Arrays;import java.util.PriorityQueue;import java.util.StringTokenizer;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][2]; StringTokenizer st; for(int i = ..

[백준] 9252번 : LCS 2[Java]

#풀이import java.io.*;import java.util.Arrays;import java.util.StringTokenizer;public class Main { public static void main(String[] args) throws IOException { BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); String word1,word2; word1 = br.readLine(); word2 = br.readLine(); int[][]dp = new int[word2.length()+1][word1.length()+1]; for(..

[백준] 1149번 : RGB거리[Java]

#풀이import java.io.*;import java.util.Arrays;import java.util.StringTokenizer;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()); StringTokenizer st; int[][] dp = new int[N+1][4]; //1:R 2:G 3:B for(int[] arr:dp){ ..

[백준] 5214번 : 환승[Java]

#풀이import java.io.*;import java.util.*;public class Main { static int N,K,M; static ArrayList[] graph; static int[] dist; static boolean[] visited; public static void bfs(int start) { Queue queue = new LinkedList(); queue.add(start); visited[start] = true; dist[start] = 1; while (!queue.isEmpty()) { int now = queue.poll(); f..

[백준] 6118번 : 숨바꼭질[Java]

#풀이import java.io.*;import java.util.*;public class Main { static int N, M; static ArrayList[] graph; static int[] dist; static boolean[] visited; public static void bfs(int start) { Queue queue = new LinkedList(); queue.add(start); visited[start] = true; dist[start] = 0; while (!queue.isEmpty()) { int now = queue.poll(); fo..

#풀이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[] nums = new int[N]; StringTokenizer st = new StringTokenizer(br.readLine()); for(int i=0; i=0; i--){ //i로 끝나는 감소수열 ..

#풀이이진탐색 풀이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[] nums = new in..

#풀이import org.w3c.dom.Node;import java.io.*;import java.util.*;public class Main { static class Node{ int v; Node left,right; Node(int input){ this.v = input; } void insert(int num){ if(vnum){ if(left==null)left = new Node(num); else left.insert(num); } } } public static void main(St..

#풀이import java.io.*;import java.util.*;public class Main { static int V,M; static int j,s; static int[][] dist; static ArrayList ans = new ArrayList(); public static void main(String[] args) throws IOException { BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); StringTokenizer st = new StringTokenizer(br.readLine()); V = Integer.parseIn..