#. Problemhttps://www.acmicpc.net/problem/1260* 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 ..
[BOJ] 11052. 카드 구매하기(DP)
#. Problemhttps://www.acmicpc.net/problem/11052* 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[i][j] 는 구매하려고 하..
[BOJ] 2011. 암호코드(DP)
#. Problemhttps://www.acmicpc.net/problem/2011* 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주어진 예제를 뜯어보자..!25114..
[BOJ] 2225. 합분해(DP)
#. Problemhttps://www.acmicpc.net/problem/2225* The copyright in this matter is in BOJ 0부터 N까지의 정수 K개를 더해서 그 합이 N이 되는 경우의 수를 구하는 프로그램을 작성하시오. 덧셈의 순서가 바뀐 경우는 다른 경우로 센다(1+2와 2+1은 서로 다른 경우). 또한 한 개의 수를 여러 번 쓸 수도 있다. #. 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 t..
#. 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의 기본 동작은 여기를 참고해..