BOJ 11055 가장 큰 증가 부분 수열

https://www.acmicpc.net/problem/11055

https://github.com/simjaemun2/BaekJoon/blob/master/BOJ11055/BOJ11055.cpp

분류 : DP

난이도 : M

{5 4 1 2 3} 과 같은 경우를 고려하자

BOJ 2294 동전 2

https://www.acmicpc.net/problem/2294

https://github.com/simjaemun2/BaekJoon/blob/master/BOJ229949/BOJ2294.cpp

분류 : DP

난이도 : M

BOJ 1699 제곱수의 합

https://www.acmicpc.net/problem/1699

https://github.com/simjaemun2/BaekJoon/blob/master/BOJ1699/BOJ1699.cpp

분류 : DP

난이도 : M

BOJ 11051 이항 계수 2

https://www.acmicpc.net/problem/11051

https://github.com/simjaemun2/BaekJoon/blob/master/BOJ11051/BOJ11051.cpp

분류 : DP

난이도 : M

BOJ 1160 캡틴 이다솜

https://www.acmicpc.net/problem/1660

https://github.com/simjaemun2/BaekJoon/blob/master/BOJ1160/BOJ1160.cpp

분류 : DP

난이도 : MH

동전 문제와 비슷하다는 것을 파악하자

BOJ 1965 상자넣기

https://www.acmicpc.net/problem/1965

https://github.com/simjaemun2/BaekJoon/blob/master/BOJ1965/BOJ1965.cpp

분류 : DP

난이도 : M

BOJ 11060 점프 점프

https://www.acmicpc.net/problem/11060

https://github.com/simjaemun2/BaekJoon/blob/master/BOJ11060/BOJ11060.cpp

분류 : DP

난이도 : M

인풋 범위를 잘 읽자

BOJ 2156 포도주 시식

https://www.acmicpc.net/problem/2156

https://github.com/simjaemun2/BaekJoon/blob/master/BOJ2156/BOJ2156.cpp

분류 : DP

난이도 : MH

BOJ 11048 이동하기

https://github.com/simjaemun2/BaekJoon/blob/master/BOJ11048/BOJ11048.cpp

분류 : DP

난이도 : M

BOJ 1904 01타일

https://www.acmicpc.net/problem/1904

https://github.com/simjaemun2/BaekJoon/blob/master/BOJ1904/BOJ1904.cpp

분류 : DP

난이도 : M

BOJ 11057 오르막 수

https://www.acmicpc.net/problem/11057

https://github.com/simjaemun2/BaekJoon/blob/master/BOJ11057/BOJ11057.cpp

분류 : DP

난이도 : MH

BOJ 9465 스티커

https://www.acmicpc.net/problem/9465

https://github.com/simjaemun2/BaekJoon/blob/master/BOJ9465/BOJ9465.cpp

분류 : DP

난이도 : MH

BOJ 11052 붕어빵 판매하기

https://github.com/simjaemun2/BaekJoon/blob/master/BOJ11052/BOJ11052.cpp

분류 : DP

난이도 : M

BOJ 10844 - 쉬운 계단 수

https://www.acmicpc.net/problem/10844

https://github.com/simjaemun2/BaekJoon/blob/master/BOJ10844/BOJ10844.cpp

분류 : DP

난이도 : MH

! 연산자를 이용하여 Sliding DP 기법을 사용할 수 있다.

! : Logical Not

BOJ 2193 이친수

https://www.acmicpc.net/problem/2193

https://github.com/simjaemun2/BaekJoon/blob/master/BOJ2193/BOJ2193.cpp

분류 : DP

난이도 : M

피보나치 수열에서 N이 커질 때, 32 bit 정수형의 범위를 벗어나는지 확인해야 한다.

BOJ 1463 1로 만들기

https://www.acmicpc.net/problem/1463

https://github.com/simjaemun2/BaekJoon/blob/master/BOJ1463/BOJ1463.cpp

분류 : DP

난이도 : M

DP를 이용하지 않고, % 연산을 잘 활용하면 속도를 더 줄일 수 있다. 

BOJ 11726 2×n 타일링

https://www.acmicpc.net/problem/11726

https://github.com/simjaemun2/BaekJoon/blob/master/BOJ11726/BOJ11726.cpp

분류 : DP

난이도 : M

BOJ 11727 2×n 타일링 2

https://www.acmicpc.net/problem/11727

https://github.com/simjaemun2/BaekJoon/blob/master/BOJ11727/BOJ11727.cpp

분류 : DP

난이도 : M

[BOJ 10808 알파벳 개수]

https://www.acmicpc.net/problem/10808

https://github.com/simjaemun2/BaekJoon/blob/master/BOJ10808/BOJ10808.cpp

분류 : 기본 cache

난이도 : M

[BOJ 10809 알파벳 찾기]

https://www.acmicpc.net/problem/10809

https://github.com/simjaemun2/BaekJoon/blob/master/BOJ10809/BOJ10809.cpp

분류 : 기본 cache

난이도 : M

[BOJ2589] 보물섬

https://www.acmicpc.net/problem/2589

https://github.com/simjaemun2/BaekJoon/blob/master/BOJ2589/BOJ2589.cpp

BFS 기본

난이도 : M

https://www.acmicpc.net/problem/2980

난이도 : M

https://github.com/simjaemun2/BaekJoon/blob/master/BOJ2980/BOJ2980.cpp

완전탐색, 시뮬레이션