More actions
imported>joojis No edit summary |
imported>joojis No edit summary |
||
| Line 49: | Line 49: | ||
* 문제 | * 문제 | ||
** http://poj.org/problem?id=1149 | ** http://poj.org/problem?id=1149 | ||
** https://www.acmicpc.net/problem/6086 | |||
=== 강연결 요소 (Strongly Connected Componenets) === | === 강연결 요소 (Strongly Connected Componenets) === | ||
=== 단절점 (Articulation Point) === | === 단절점 (Articulation Point) === | ||
Revision as of 10:46, 12 February 2016
상위 항목: 알고리즘
탐색
Backtracking
너비우선탐색 (BFS)
깊이우선탐색 (DFS)
탐욕법 (Greedy)
동적계획법 (Dynamic Programming)
최장 증가 수열
분할 정복
세그먼트 트리 (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
- 문제
기하
벡터 내적/외적
- 문제
Convex Hull
문자열
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만에 풀이 가능)