#. Problemhttps://www.acmicpc.net/problem/1699* The copyright in this matter is in BOJ #. Resolution Process 1. Read and understand problem 2. Redefine the problem + abstract 3. Create solution plan (select Algorithm, Data structure) 4. Prove the plan (check performance time and usage memory) 5. Carry out the plan 6. Look back on the plan and find a way to improve it #. Solve가방 문제와 유사하다. 먼저 dp[N..
#. Problemhttps://www.acmicpc.net/problem/2579* The copyright in this matter is in BOJ #. Resolution Process 1. Read and understand problem 2. Redefine the problem + abstract- 계단은 한 번에 한 계단씩 또는 두 계단씩 오를 수 있다. - 즉, 한 계단을 밟으면서 이어서 다음 계단이나, 다음 다음 계단으로 오를 수 있다.- 연속된 세 개의 계단을 모두 밟아서는 안 된다. 단, 시작점은 계단에 포함되지 않는다.- 마지막 도착 계단은 반드시 밟아야 한다. 3. Create solution plan (select Algorithm, Data structure) 4. Prov..
[BOJ] 1912. 연속합(DP, 누적합)
#. Problemhttps://www.acmicpc.net/problem/1912* The copyright in this matter is in BOJ #. Resolution Process 1. Read and understand problem 2. Redefine the problem + abstract 3. Create solution plan (select Algorithm, Data structure) 4. Prove the plan (check performance time and usage memory) 5. Carry out the plan 6. Look back on the plan and find a way to improve it #. Solve생각보다 단순한(?) 문제다.DP[N..
[BOJ] 11054. 가장 긴 바이토닉 부분 수열(DP, LIS 응용)
#. Problemhttps://www.acmicpc.net/problem/11054* The copyright in this matter is in BOJ #. Resolution Process 1. Read and understand problem 2. Redefine the problem + abstract 3. Create solution plan (select Algorithm, Data structure) 4. Prove the plan (check performance time and usage memory) 5. Carry out the plan 6. Look back on the plan and find a way to improve it #. SolveLIS의 기본 동작은 여기를 참고해..
#. Problemhttps://www.acmicpc.net/problem/11722* The copyright in this matter is in BOJ #. Resolution Process 1. Read and understand problem 2. Redefine the problem + abstract 3. Create solution plan (select Algorithm, Data structure) 4. Prove the plan (check performance time and usage memory) 5. Carry out the plan 6. Look back on the plan and find a way to improve it #. SolveLIS문제(최소 증가 부분 수열)의..
#. Problemhttps://www.acmicpc.net/problem/11053* The copyright in this matter is in BOJ #. Resolution Process 1. Read and understand problem 2. Redefine the problem + abstract 3. Create solution plan (select Algorithm, Data structure) 4. Prove the plan (check performance time and usage memory) 5. Carry out the plan 6. Look back on the plan and find a way to improve it #. SolveLIS의 자세한 설명은 이 문제를 ..
[BOJ] 2156. 포도주 시식(DP)
#. Problemhttps://www.acmicpc.net/problem/2156* The copyright in this matter is in BOJ #. Resolution Process 1. Read and understand problem 2. Redefine the problem + abstract- 포도주 잔을 선택하면 그 잔에 들어있는 포도주는 모두 마셔야 하고, 마신 후에는 원래 위치에 다시 놓아야 한다.- 연속으로 놓여 있는 3잔을 모두 마실 수는 없다. 3. Create solution plan (select Algorithm, Data structure) 4. Prove the plan (check performance time and usage memory) 5. Carry ou..
[BOJ] 9465. 스티커(DP 기초)
#. Problemhttps://www.acmicpc.net/problem/9465* The copyright in this matter is in BOJ #. Resolution Process 1. Read and understand problem 2. Redefine the problem + abstract 3. Create solution plan (select Algorithm, Data structure) 4. Prove the plan (check performance time and usage memory) 5. Carry out the plan 6. Look back on the plan and find a way to improve it #. Solve귀여운 스티커 문제다...ㅋㅋㅋㅋㅋ가..