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<num; i++) { arr[i] = sc.nextInt(); } int[] d = new int[num]; for(int i=0; i<num; i++) { d[i] = arr[i]; for(int j=0; j<i; j++) { if(arr[i] > arr[j] && d[i] < d[j]+arr[i]) { d[i] = d[j]+arr[i]; } } } int sum = d[0]; for (int i=1; i<num; i++) { sum = Math.max(sum, d[i]); } System.out.println(sum); } }