1. 1로 만들기: https://www.acmicpc.net/problem/1463
2. 2×n 타일링: https://www.acmicpc.net/problem/11726
3. 1, 2, 3 더하기: https://www.acmicpc.net/problem/9095
4. 쉬운 계단 수: https://www.acmicpc.net/problem/10844
5. 오르막 수: https://www.acmicpc.net/problem/11057
6. 이친수: https://www.acmicpc.net/problem/2193
7. 가장 긴 증가하는 부분 수열: https://www.acmicpc.net/problem/11053
8. 연속합: https://www.acmicpc.net/problem/1912
9. 합분해: https://www.acmicpc.net/problem/2225
풀이: https://www.youtube.com/watch?v=0o2hF-To_6Q&t=3595s&list=PLCk-aLyP3niLZgoxL_BNXX9d7Tlt3e3qV&index=3
* LIS - O(n^2) 해법
https://www.youtube.com/watch?v=CE2b_-XfVDk
* LIS - O(nlogn) 해법
https://www.youtube.com/watch?v=S9oUiVYEq7E&feature=youtu.be
http://www.geeksforgeeks.org/longest-monotonically-increasing-subsequence-size-n-log-n/
* LIS 응용 문제 추천
https://www.acmicpc.net/problem/2532
* 프로그래밍 대회에 도전해보세요. 입상한 경력이 있으면 입사하기가 수월해집니다.
|
