Wireless Network Time Limit: 10000MS Memory Limit: 65536K Total Submissions: 13323 …
标签：Online Judge POJ
POJ 3468 A Simple Problem with Integers (splay tree入门)
A Simple Problem with Integers Time Limit: 5000MS Memory Limit: 131072K Total Submissions:&nb…
POJ 3660 Cow Contest（传递闭包floyed算法）
Cow Contest Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 5989 Accep…
POJ 3128 Leonardo's Notebook（置换）
Leonardo’s Notebook Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 1514 Accept…
POJ 3415 Common Substrings (后缀数组，长度不小于k的公共子串的个数）
Common Substrings Time Limit: 5000MS Memory Limit: 65536K Total Submissions: 5495 …
POJ 1274 The Perfect Stall（二分图匹配）
The Perfect Stall Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 14447 Accepted: 661…
POJ 3281 Dining（最大流）
Dining Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 6586 Accepted: 3015 Descriptio…
POJ 1797 Heavy Transportation （Dijkstra算法，求路径的最小值中的最大值）
Heavy Transportation Time Limit: 3000MS Memory Limit: 30000K Total Submissions: 17314 &n…
POJ 3294 Life Forms （后缀数组，求出现在不少于k个字符串的最长子串）
Life Forms Time Limit: 5000MS Memory Limit: 65536K Total Submissions: 7322 Accept…
POJ 3264 Balanced Lineup（线段树）
Balanced Lineup Time Limit: 5000MS Memory Limit: 65536K Total Submissions: 23699 Accepted: 11019…
POJ 2406 Power Strings(KMP next[]函数）
Power Strings Time Limit: 3000MS Memory Limit: 65536K Total Submissions: 23112 Accepted: 9691 De…
ACM/ICPC 之 判别MST唯一性-Kruskal解法(POJ1679)
判别MST是否唯一的例题。 POJ1679-The Unique MST 题意：给定图，求MST(最小生成树)是否唯一，唯一输出路径长，否则输出Not Unique! …
