상위 항목: [알고리즘]

[[TableOfContents]]
=== 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

=== 기하 ===
 * 문제
  * http://codeforces.com/contest/614/problem/C
   * http://www.ahristov.com/tutorial/geometry-games/point-line-distance.html: 점과 직선 사이의 거리

=== 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만에 풀이 가능)