목록다이나믹 (17)

hara

BEAKJOON JAVA ALGORITHM #11054(가장 긴 바이토닉 부분 수열)

https://www.acmicpc.net/problem/11054 import java.util.Scanner; public class a11054 { public static void main(String[] args) { Scanner sc = new Scanner(System.in); int num = sc.nextInt(); int[] arr1 = new int[num]; int[] arr2 = new int[num]; int k = num-1; for(int i=0; i
공부/알고리즘 2017. 8. 21. 14:05
BEAKJOON JAVA ALGORITHM #11722(가장 긴 감소하는 부분 수열)

https://www.acmicpc.net/problem/11722 import java.util.Scanner; public class a11722 { public static void main(String[] args) { Scanner sc = new Scanner(System.in); int num = sc.nextInt(); int[] arr = new int[num]; for(int i=num-1; i>=0; i--) { arr[i] = sc.nextInt(); } int[] d = new int[num]; for(int i=0; i
공부/알고리즘 2017. 8. 21. 14:04
BEAKJOON JAVA ALGORITHM #11055(가장 큰 증가 부분 수열)

https://www.acmicpc.net/problem/11055 import java.util.Scanner; public class a11055 { public static void main(String[] args) { Scanner sc = new Scanner(System.in); int num = sc.nextInt(); int[] arr = new int[num]; for(int i=0; i
공부/알고리즘 2017. 8. 21. 14:01
BEAKJOON JAVA ALGORITHM #11053(가장 긴 증가하는 부분 수열)

https://www.acmicpc.net/problem/11053 import java.util.Scanner; public class a11053 { public static void main(String[] args) { Scanner sc = new Scanner(System.in); int num = sc.nextInt(); int[] arr = new int[num]; for(int i=0; i
공부/알고리즘 2017. 8. 21. 14:00
BEAKJOON JAVA ALGORITHM #2156(포도주 시식)

https://www.acmicpc.net/problem/2156 import java.util.Scanner; public class a2156 { public static void main(String[] args) { Scanner sc = new Scanner(System.in); int num = sc.nextInt(); int[] arr = new int[num+1]; for(int i=1; i= 2) { d[2] = arr[1] + arr[2]; } for(int i=3; i
공부/알고리즘 2017. 8. 16. 18:19
BEAKJOON JAVA ALGORITHM #9465(스티커)

https://www.acmicpc.net/problem/9465 import java.util.Scanner; public class a9465 { public static void main(String[] args) { Scanner sc = new Scanner(System.in); int num = sc.nextInt(); for(int i=0; i
공부/알고리즘 2017. 8. 16. 18:18
Prev 1 2 3 Next