BOJ 11058 크리보드

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

https://github.com/simjaemun2/BaekJoon/blob/90913808d43003dca9a2aae8903a87cd1aa93220/BOJ11058/BOJ11058.cpp

분류 : DP

난이도 : MH

답의 범위가 long long int 인 것에 유의

BOJ 12996 Acka

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

https://github.com/simjaemun2/BaekJoon/blob/0ff6eb28381e07db7ade06b12c759fc0f1a22c37/BOJ129996/BOJ12996.cpp

난이도 : MH

분류 : DP

1등답을 보면 일반적인 DP가 아닌

이항계수를 이용해서 0ms로 푸는데 코드가 이해가지 않는다...

BOJ 10830 행렬 제곱

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

https://github.com/simjaemun2/BaekJoon/blob/a15f61e0f7faf19a9de297a3fee30c0d1c36b341/BOJ10830/BOJ10830.cpp

분류 : 행렬

난이도 : MH

BOJ 1629 곱셈

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

https://github.com/simjaemun2/BaekJoon/blob/86b5b4671774913db60122cae06c1fb771c49546/BOJ1629/BOJ1629.cpp

분류 : 분할정복

난이도 : MH

BOJ 1697 숨바꼭질

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

https://github.com/simjaemun2/BaekJoon/blob/d8213944d77473c63610c100cc0a801093d4e81a/BOJ1697/BOJ1697.cpp

분류 : queue, bfs

난이도 : MH

BOJ 12851 숨바꼭질 2

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

https://github.com/simjaemun2/BaekJoon/blob/50b26d93070e3808b5441cd4a6d1f7b6a98079ca/BOJ12851/BOJ12851.cpp

분류 : queue, bfs

난이도 : MH

BOJ 13549 숨바꼭질 3

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

https://github.com/simjaemun2/BaekJoon/commit/27b0e633567238816e9b57d036bdb0ab415f1f75

분류 : queue, bfs

난이도 : MH

BOJ 2740 행렬 곱셈

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

https://github.com/simjaemun2/BaekJoon/blob/10dfcfac6496e51907229f80f30ff288109e02d2/BOJ13392/BOJ13392.cpp

분류 : 행렬

난이도 : M

https://www.acmicpc.net/submit/1181

https://github.com/simjaemun2/BaekJoon/blob/395622398c9c813dc3e106887d9dfb64bf1ef61b/BOJ1181/BOJ118818.cpp

분류 : 정렬

난이도 : M

BOJ 10422 괄호

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

https://github.com/simjaemun2/BaekJoon/blob/356cb6a155941b50fa2b9748f0dee711683bd965/BOJ10422/BOJ10422.cpp

난이도 : H

분류 : DP

카탈란 수

http://blog.naver.com/wlsthf9401/60168275689

BOJ 1916 최소비용 구하기

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

https://github.com/simjaemun2/BaekJoon/blob/ddddf6df4772db8a20ff8cccd5fe6f8aba446afc/BOJ1916/BOJ1916.cpp

난이도 : MH

분류 : Graph, dijkstra

BOJ 1504 특정한 최단 경로

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

https://github.com/simjaemun2/BaekJoon/blob/5417a96d2ebad5e1b23271561afd521f13dc62a4/BOJ1504/BOJ1504.cpp

난이도 : MH

분류 : Graph, dijkstra, floyd

다이스트라를 여러번 사용하거나 플로이드를 이용

BOJ 2216 문자열과 점수

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

https://github.com/simjaemun2/BaekJoon/blob/74f78610ba93474d2ec4ba4a7560edb9dadd89e5/BOJ2216/BOJ2216.cpp

난이도 : MH

분류 : DP

슬라이딩 기법을 사용해 메모리를 줄이면, 속도까지 더 줄일 수 있다.

BOJ 1655 가운데를 말해요

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

https://github.com/simjaemun2/BaekJoon/blob/870467e843a068821f90865d666e9d9047fb50f3/BOJ1655/BOJ1655.cpp

분류 : heap,. priority_queue

난이도 : MH

BOJ 1759 암호 만들기

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

분류 : 순열

난이도 : MH

BOJ 2167 2차원 배열의 합

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

https://github.com/simjaemun2/BaekJoon/blob/f89717ec547b5feb53bf13c3ce97cd37771321bb/BOJ2167/BOJ2167.cpp

분류 : DP

난이도 : MH

BOJ 2163 초콜릿 자르기

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

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

분류 : DP

난이도 : MH

a*b-1 로 간단하게 풀 수 있다

BOJ 11659 구간 합 구하기 4

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

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

분류 : DP

난이도 : MH

BOJ 9012 괄호

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

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

분류 : stack

난이도 : M

BOJ 연속합 2

BOJ 12026 BOJ 거리

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

https://github.com/simjaemun2/BaekJoon/blob/edbbff8c254d1c7d87481726da05d060b705a0c2/BOJ13398/BOJ13398.cpp

BOJ 2410 2의 멱수의 합

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

https://github.com/simjaemun2/BaekJoon/blob/eff305dc05c1bbc24c3b6a1fdc5ed787eba24339/BOJ2410/BOJ2360.cpp

분류 : DP

난이도 : MH

무식한 DP 말고

f(n) = f(n-1) + f(n/2) 을 이용하면 선형 시간에 해결 가능하다.

BOJ 9251 LCS

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

https://github.com/simjaemun2/BaekJoon/blob/4202cc7ae0310e07677d9a567a41dcffb6655e7e/BOJ9251/BOJ9251.cpp

분류 : DP, LCS

난이도 : MH

BOJ 5582 공통 부분 문자열

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

https://github.com/simjaemun2/BaekJoon/blob/088991b2fb86182953ffa74279bc9688a30f44a9/BOJ5582/BOJ5582.cpp

분류 : DP, LCP

난이도 : MH

BOJ 1958 LCS 3

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

https://github.com/simjaemun2/BaekJoon/blob/4202cc7ae0310e07677d9a567a41dcffb6655e7e/BOJ9251/BOJ9251.cpp

분류 : DP, LCS

난이도 : MH

BOJ 1915 가장 큰 정사각형

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

https://github.com/simjaemun2/BaekJoon/blob/980a30027b9a027f1205449814fcad76d9da1b72/BOJ1915/BOJ1915.cpp

분류 : DP

난이도 : MH

BOJ 9252 LCS 2

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

https://github.com/simjaemun2/BaekJoon/blob/cd07ac84c13398a34b0ddc408c59a3cc1a16b8c1/BOJ9252/BOJ5252.cpp

분류 : DP. LCS

난이도 : MH

재귀함수를 이용해 최적화 답을 출력한다.

BOJ 2602 돌다리 건너기

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

https://github.com/simjaemun2/BaekJoon/blob/8a6044eccf83d3590bafccbdb3180f01d0cf6e54/BOJ2602/BOJ2602.cpp

분류 : DP

난이도 : MH