[백준] 7861번 : Longest Ordered Subsequence – JAVA [자바]
https://www.acmicpc.net/problem/7861 7861번: Longest Ordered Subsequence A numeric sequence of ai is ordered if a1 ≤ a2 ≤ … ≤ aN. Let the subsequence of the given numeric sequence (a1, a2, …, aN) be any sequence (ai1, ai2, …, aiK), where 1 ≤ i1 < i2 < … < iK ≤ N. For example, the sequence (1, 7, 3, 5, 9, 4, www.acmicpc.net 문제 문제 풀이 백준 7861번 Longest Ordered Subsequence는 백준 11053번 가장 긴 증가하는 부분 수열이랑..
2022. 4. 1.