01 2016 档案

The Same Game-POJ1027模拟
摘要：The Same Game Time Limit: 1000MS Memory Limit: 10000KDescriptionThe game named “Same” is a single person game played on a 10 \Theta 15 boa... 阅读全文

posted @ 2016-01-28 17:36 一骑绝尘去 阅读(381) 评论(0) 推荐(0)

Flesch Reading Ease -POJ3371模拟
摘要：Flesch Reading Ease Time Limit: 1000MS Memory Limit: 65536KDescriptionFlesch Reading Ease, a readability test named after its deviser Rudol... 阅读全文

posted @ 2016-01-28 17:29 一骑绝尘去 阅读(523) 评论(0) 推荐(0)

TopCoder kawigiEdit插件配置
摘要：kawigiEdit插件可以提高 TopCoder编译，提交效率，可以管理保存每次SRM的代码。kawigiEdit下载地址：http://code.google.com/p/kawigiedit/downloads/list我用C++，以后设置是设置C++的，其他的类似。一、添加... 阅读全文

posted @ 2016-01-28 13:53 一骑绝尘去 阅读(210) 评论(0) 推荐(0)

Instant Complexity - POJ1472
摘要：Instant Complexity Time Limit: 1000MS Memory Limit: 10000KDescriptionAnalyzing the run-time complexity of algorithms is an important tool ... 阅读全文

posted @ 2016-01-27 17:50 一骑绝尘去 阅读(196) 评论(0) 推荐(0)

Lucky and Good Months by Gregorian Calendar - POJ3393模拟
摘要：Lucky and Good Months by Gregorian Calendar Time Limit: 1000MS Memory Limit: 65536KDescriptionHave you ever wondered why normally an year h... 阅读全文

posted @ 2016-01-27 09:34 一骑绝尘去 阅读(407) 评论(0) 推荐(0)

Organize Your Train part II-POJ3007模拟
摘要：Organize Your Train part II Time Limit: 1000MS Memory Limit: 65536KDescriptionRJ Freight, a Japanese railroad company for freight operation... 阅读全文

posted @ 2016-01-26 20:41 一骑绝尘去 阅读(203) 评论(0) 推荐(0)

Instantaneous Transference--POJ3592Tarjan缩点+搜索
摘要：Instantaneous Transference Time Limit: 5000MS Memory Limit: 65536KDescriptionIt was long ago when we played the game Red Alert. There is a ... 阅读全文

posted @ 2016-01-26 16:16 一骑绝尘去 阅读(211) 评论(0) 推荐(0)

Codeforces617 E . XOR and Favorite Number(莫队算法)
摘要：XOR and Favorite Number time limit per test: 4 seconds memory limit per test: 256 megabytes input: standard input output: standard ou... 阅读全文

posted @ 2016-01-26 10:38 一骑绝尘去 阅读(212) 评论(0) 推荐(0)

Corn Fields——POJ3254状态压缩Dp
摘要：Corn Fields Time Limit: 2000MS Memory Limit: 65536KDescriptionFarmer John has purchased a lush new rectangular pasture composed of M by N (... 阅读全文

posted @ 2016-01-25 19:49 一骑绝尘去 阅读(160) 评论(0) 推荐(0)

有向图的强连通分量的求解算法Tarjan
摘要：Tarjan算法Tarjan算法是基于dfs算法，每一个强连通分量为搜索树中的一颗子树。搜索时，把当前搜索树中的未处理的结点加入一个栈中，回溯时可以判断栈顶到栈中的结点是不是在同一个强连通分量中。当dfn[u]=low[u]时，以u为根的搜索子树上的所有结点是一个强连通分量，其中d... 阅读全文

posted @ 2016-01-24 17:09 一骑绝尘去 阅读(186) 评论(0) 推荐(0)

King's Quest —— POJ1904(ZOJ2470)Tarjan缩点
摘要：King’s Quest Time Limit: 15000MS Memory Limit: 65536K Case Time Limit: 2000MS DescriptionOnce upon a time there lived a king and he... 阅读全文

posted @ 2016-01-24 16:44 一骑绝尘去 阅读(151) 评论(0) 推荐(0)

Father Christmas flymouse--POJ3160Tarjan
摘要：Father Christmas flymouse Time Limit: 1000MS Memory Limit: 131072KDescriptionAfter retirement as contestant from WHU ACM Team, flymouse ... 阅读全文

posted @ 2016-01-24 12:03 一骑绝尘去 阅读(213) 评论(0) 推荐(0)

Network of Schools --POJ1236 Tarjan
摘要：Network of Schools Time Limit: 1000MS Memory Limit: 10000KDescriptionA number of schools are connected to a computer network. Agreements... 阅读全文

posted @ 2016-01-23 09:19 一骑绝尘去 阅读(150) 评论(0) 推荐(0)

The Bottom of a Graph-POJ2553强连通
摘要：The Bottom of a Graph Time Limit: 3000MS Memory Limit: 65536K Total Submissions: 9759 Accepted: 4053Description We will use the follow... 阅读全文

posted @ 2016-01-22 20:10 一骑绝尘去 阅读(143) 评论(0) 推荐(0)

Popular Cows-POJ2186Tarjan
摘要：Time Limit: 2000MS Memory Limit: 65536K Description Every cow's dream is to become the most popular cow in the herd. In a herd of ... 阅读全文

posted @ 2016-01-22 17:10 一骑绝尘去 阅读(190) 评论(0) 推荐(0)

Going from u to v or from v to u?_POJ2762强连通+并查集缩点+拓扑排序
摘要：Going from u to v or from v to u? Time Limit: 2000MS Memory Limit: 65536K Description In order to make their sons brave, Jiaj... 阅读全文

posted @ 2016-01-22 14:37 一骑绝尘去 阅读(364) 评论(0) 推荐(0)

Network-POJ3694并查集+LCA
摘要：Network Time Limit: 5000MS Memory Limit: 65536K Description A network administrator manages a large network. The network consist... 阅读全文

posted @ 2016-01-21 21:31 一骑绝尘去 阅读(165) 评论(0) 推荐(0)

Internship-ZOJ2532(网络流求割边)
摘要：Internship Time Limit: 5 Seconds Memory Limit: 32768 KB CIA headquarter collects data from across the country through its classified networ... 阅读全文

posted @ 2016-01-21 14:23 一骑绝尘去 阅读(232) 评论(0) 推荐(0)

Redundant Paths-POJ3177（并查集+双连通分量）
摘要：Redundant Paths Description In order to get from one of the F (1 2 and 1 –> 6 –> 5 –> 2 1 – 4: 1 –> 2 –> 3 –> 4 and 1 –> 6 –> 5 –> 4 3 – 7: 3... 阅读全文

posted @ 2016-01-11 10:31 一骑绝尘去 阅读(374) 评论(0) 推荐(0)

Knights of the Round Table-POJ2942（双连通分量+交叉染色）
摘要：Knights of the Round Table Description Being a knight is a very attractive career: searching for the Holy Grail, saving damsels in distress, and... 阅读全文

posted @ 2016-01-10 17:22 一骑绝尘去 阅读(168) 评论(0) 推荐(0)

Burning Bridges-ZOJ1588（割边求解）
摘要：Burning Bridges Time Limit: 5 Seconds Memory Limit: 32768 KBFerry Kingdom is a nice little country located on N islands that are connec... 阅读全文

posted @ 2016-01-09 20:05 一骑绝尘去 阅读(155) 评论(0) 推荐(0)

Cable TV Network-POJ1966图的连通度
摘要：Cable TV Network Time Limit: 1000MS Memory Limit: 30000K Total Submissions: 4404 Accepted: 2047 DescriptionThe interconnection o... 阅读全文

posted @ 2016-01-09 16:45 一骑绝尘去 阅读(208) 评论(0) 推荐(0)