728x90 알고리즘/이론 및 팁3 최장 증가 부분수열 (이진탐색) import java.util.Arrays; import java.util.Scanner; public class DP2_LISTest2 { public static void main(String[] args) { Scanner sc = new Scanner(System.in); int N = sc.nextInt(); int[] arr = new int[N]; int[] LIS = new int[N]; for (int i = 0; i < N; i++) { arr[i]=sc.nextInt(); } int size=0; for (int i = 0; i < N; i++) { int temp = Math.abs(Arrays.binarySearch(LIS, 0,size,arr[i]))-1; LIS[temp] = .. 2021. 9. 16. 최대 공약수 public static int gcd(int a, int b) { while(b!=0){ int r = a%b; a= b; b= r; } return a; } 2021. 9. 5. 프림 알고리즘 package day12; import java.io.BufferedReader; import java.io.FileInputStream; import java.io.IOException; import java.io.InputStreamReader; import java.util.Arrays; import java.util.StringTokenizer; public class MSTPrimTest { public static void main(String[] args) throws NumberFormatException, IOException { System.setIn(new FileInputStream("prim_input.txt")); BufferedReader br = new BufferedRead.. 2021. 8. 25. 이전 1 다음 728x90
