알고리즘/문제유형

Difference between r1.15 and the current

@@ -10,6 +10,12 @@

* 문제
* http://codeforces.com/problemset/problem/622/E
== 동적계획법 (Dynamic Programming) ==

=== 일반 ===

* 문제 (난이도순?)

* http://codeforces.com/problemset/problem/628/B

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

* https://icpcarchive.ecs.baylor.edu/index.php?option=com_onlinejudge&Itemid=8&category=639&page=show_problem&problem=4916

* https://www.acmicpc.net/problem/6569

=== 최장 증가 수열 ===
* 자료
* http://dyngina.tistory.com/16

@@ -32,6 +38,10 @@

=== Convex Hull ===
* 자료
* http://www.dcs.gla.ac.uk/~pat/52233/slides/Hull1x1.pdf

=== Plane Sweeping ===

* 문제

* https://www.acmicpc.net/problem/2672

== 문자열 ==
=== KMP 문자열 탐색 ===
* 자료

상위 항목: 알고리즘

1. 탐색 ¶

1.1. Backtracking ¶

1.2. 너비우선탐색 (BFS) ¶

1.3. 깊이우선탐색 (DFS) ¶

2. 탐욕법 (Greedy) ¶

문제
- http://codeforces.com/problemset/problem/622/E

3. 동적계획법 (Dynamic Programming) ¶

3.1. 일반 ¶

문제 (난이도순?)

3.2. 최장 증가 수열 ¶

자료
- http://dyngina.tistory.com/16
문제
- http://codeforces.com/contest/629/problem/D

4. 분할 정복 ¶

4.1. 세그먼트 트리 (Segment Tree) ¶

자료
- http://codeforces.com/blog/entry/18051: Efficient and easy segment trees
- http://codeforces.com/blog/entry/15890: Algorithm Gym :: Everything About Segment Trees
문제
- http://codeforces.com/contest/380/problem/C

5. 기하 ¶

6. 문자열 ¶

6.1. KMP 문자열 탐색 ¶

자료
- http://carstart.tistory.com/143: KMP 알고리즘 (한글)
- http://www.inf.fh-flensburg.de/lang/algorithmen/pattern/kmpen.htm: Knuth-Morris-Pratt algorithm
- https://www.youtube.com/watch?v=HaAu5ZGj6fc: Knuth Morris Pratt String Matching Algorithm
문제
- http://codeforces.com/contest/471/problem/D (다른 풀이를 통해 nlogn으로 풀 수도 있으나 KMP로 n만에 풀이 가능)

6.2. 접두사 트리 (Prefix Tree, Trie) ¶

6.3. 접미사 배열 (Suffix Array) ¶

7. 트리 및 그래프 ¶

7.1. 위상 정렬 (Topological Sort) ¶

7.2. 최소 신장 트리 (Minimum Spanning Tree) ¶

7.3. 최대 유량 알고리즘 (Maximum Flow) ¶

자료
- http://egloos.zum.com/musicdiary/v/4207458
문제
- http://poj.org/problem?id=1149
- https://www.acmicpc.net/problem/6086