[BOJ] 12849. 본대 산책(경로 DP)py,cpp
#. Problemhttps://www.acmicpc.net/problem/12849* 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문제는DP문제에서도 전형적..
[BOJ] 1915. 가장 큰 정사각형(DP).py.cpp
#. Problemhttps://www.acmicpc.net/problem/1915* 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유형만 잘 파악하면 되는 문제라고 하..
[BOJ] 2167. 2차원 배열의 합(DP, 누적합).py.cpp
#. Problemhttps://www.acmicpc.net/problem/2167* 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최대 배열의 크기는 300x300 =..
#. Problemhttps://www.acmicpc.net/problem/11055* The copyright in this matter is in BOJ #. Solve전형적인 DP, LIS 문제이다.자세한 동작 설명은 문제를 참고해보자. #. Python Code12345678910import copyN, A = int(input()), list(map(int, input().split()))dp = copy.deepcopy(A) for i in range(1, N): for j in range(i): if A[i] > A[j]: dp[i] = max(dp[i], dp[j] + A[i]) print(max(dp))Colored by Color Scriptercs line 3) 자기 자신이 가장 긴 ..
[BOJ] 1932.정수삼각형.py.cpp (DP 기초)
#. Problemhttps://www.acmicpc.net/problem/1932* 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입력이 아래와 같을 때, 7 3 8 ..
#. Problem https://www.acmicpc.net/problem/17406* The copyright in this matter is in BOJ #. Resolution Process 1. Read and understand problem 2. Redefine the problem + abstract- 회전 연산은 세 정수 (r, c, s)- 가장 왼쪽 윗 칸이 (r-s, c-s), 가장 오른쪽 아랫 칸이 (r+s, c+s)인 정사각형을 시계 방향으로 한 칸씩 돌린다- 회전 연산은 모두 한 번씩 사용해야 하며, 순서는 임의로 정해도 된다. 3. Create solution plan (select Algorithm, Data structure) 4. Prove the plan (check p..
#. Problem https://www.acmicpc.net/problem/16768* The copyright in this matter is in BOJ #. Resolution Process 1. Read and understand problem 2. Redefine the problem + abstract- 같은 색상이면 0으로 변경- 하강하여 0으로 된 결과 셀을 채울 수 있음 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 wa..
#. Problemhttps://www.acmicpc.net/problem/1012* 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섬의 개수(?)를 구하는 문제랑 같다..