알고리즘/문제유형 - Revision history

Maintenance script: Repair batch-0006 pages from live compare

2026-03-27T01:08:37Z

Repair batch-0006 pages from live compare

← Older revision		Revision as of 01:08, 27 March 2026
Line 67:		Line 67:
	=== 강연결 요소 (Strongly Connected Componenets) ===		=== 강연결 요소 (Strongly Connected Componenets) ===
	=== 단절점 (Articulation Point) ===		=== 단절점 (Articulation Point) ===

2016-03-25T08:33:37Z

← Older revision		Revision as of 08:33, 25 March 2016
Line 12:		Line 12:
	== 동적계획법 (Dynamic Programming) ==		== 동적계획법 (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://icpcarchive.ecs.baylor.edu/index.php?option=com_onlinejudge&Itemid=8&category=639&page=show_problem&problem=4916
			** https://www.acmicpc.net/problem/6569
	=== 최장 증가 수열 ===		=== 최장 증가 수열 ===
	* 자료		* 자료

2016-03-25T08:31:58Z

← Older revision		Revision as of 08:31, 25 March 2016
Line 11:		Line 11:
	** http://codeforces.com/problemset/problem/622/E		** http://codeforces.com/problemset/problem/622/E
	== 동적계획법 (Dynamic Programming) ==		== 동적계획법 (Dynamic Programming) ==
			=== 일반 ===
			* 문제
			** https://icpcarchive.ecs.baylor.edu/index.php?option=com_onlinejudge&Itemid=8&category=639&page=show_problem&problem=4916
	=== 최장 증가 수열 ===		=== 최장 증가 수열 ===
	* 자료		* 자료

2016-02-27T03:48:06Z

← Older revision		Revision as of 03:48, 27 February 2016
Line 33:		Line 33:
	* 자료		* 자료
	** http://www.dcs.gla.ac.uk/~pat/52233/slides/Hull1x1.pdf		** http://www.dcs.gla.ac.uk/~pat/52233/slides/Hull1x1.pdf

			=== Plane Sweeping ===
			* 문제
			** https://www.acmicpc.net/problem/2672
	== 문자열 ==		== 문자열 ==
	=== KMP 문자열 탐색 ===		=== KMP 문자열 탐색 ===

2016-02-22T07:47:44Z

← Older revision		Revision as of 07:47, 22 February 2016
Line 12:		Line 12:
	== 동적계획법 (Dynamic Programming) ==		== 동적계획법 (Dynamic Programming) ==
	=== 최장 증가 수열 ===		=== 최장 증가 수열 ===
			* 자료
			** http://dyngina.tistory.com/16
			* 문제
			** http://codeforces.com/contest/629/problem/D
	== 분할 정복 ==		== 분할 정복 ==
	=== 세그먼트 트리 (Segment Tree) ===		=== 세그먼트 트리 (Segment Tree) ===

2016-02-19T12:28:22Z

← Older revision		Revision as of 12:28, 19 February 2016
Line 8:		Line 8:

	== 탐욕법 (Greedy) ==		== 탐욕법 (Greedy) ==
			* 문제
			** http://codeforces.com/problemset/problem/622/E
	== 동적계획법 (Dynamic Programming) ==		== 동적계획법 (Dynamic Programming) ==
	=== 최장 증가 수열 ===		=== 최장 증가 수열 ===

2016-02-19T09:02:37Z

← Older revision		Revision as of 09:02, 19 February 2016
Line 28:		Line 28:

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

2016-02-13T03:19:36Z

← Older revision		Revision as of 03:19, 13 February 2016
Line 46:		Line 46:
	=== 최대 유량 알고리즘 (Maximum Flow) ===		=== 최대 유량 알고리즘 (Maximum Flow) ===
	* 자료		* 자료
	** ~~추가 바람~~		** http://egloos.zum.com/musicdiary/v/4207458
	* 문제		* 문제
	** http://poj.org/problem?id=1149		** http://poj.org/problem?id=1149

2016-02-12T10:46:55Z

← Older revision		Revision as of 10:46, 12 February 2016
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) ===

2016-02-12T10:41:56Z

@@ Line 2: / Line 2: @@
 __TOC__
 == 탐색 ==
 === Backtracking ===
@@ Line 42: / Line 14: @@
 == 분할 정복 ==
+=== 세그먼트 트리 (Segment Tree) ===
 == 기하 ==
 === 벡터 내적/외적 ===
 === Convex Hull ===
 == 문자열 ==
 === KMP 문자열 탐색 ===
 === 접두사 트리 (Prefix Tree, Trie) ===
 === 접미사 배열 (Suffix Array) ===
@@ Line 57: / Line 45: @@
 === 최소 신장 트리 (Minimum Spanning Tree) ===
 === 최대 유량 알고리즘 (Maximum Flow) ===
 === 강연결 요소 (Strongly Connected Componenets) ===
 === 단절점 (Articulation Point) ===