- 博客(23)
- 资源 (4)
- 问答 (2)
- 收藏
- 关注
RSS订阅原创 Countries in War -POJ3114Tarjan缩点+SPFA
Countries in War Time Limit: 1000MS Memory Limit: 65536KDescriptionIn the year 2050, after different attempts of the UN to maintain peace in the world, the third world war broke out. The importance
2016-01-28 19:10:29
732
原创 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 board. Each square contains a ball colored red (R), green (G)
2016-01-28 17:36:45
949
原创 Flesch Reading Ease -POJ3371模拟
Flesch Reading Ease Time Limit: 1000MS Memory Limit: 65536KDescriptionFlesch Reading Ease, a readability test named after its deviser Rudolf Flesch, is among most ubiquitously used readability test
2016-01-28 17:29:19
497
转载 TopCoder kawigiEdit插件配置
kawigiEdit插件可以提高 TopCoder编译，提交效率，可以管理保存每次SRM的代码。kawigiEdit下载地址：http://code.google.com/p/kawigiedit/downloads/list我用C++，以后设置是设置C++的，其他的类似。一、添加kawigiEdit插件。 1. 打开TC客户端–Option–Editor 2. 点击Add，
2016-01-28 13:53:25
493
原创 Instant Complexity - POJ1472
Instant Complexity Time Limit: 1000MS Memory Limit: 10000KDescriptionAnalyzing the run-time complexity of algorithms is an important tool for designing efficient programs that solve a problem. An a
2016-01-27 17:50:00
387
原创 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 has 365 days, not 400 days? Why August have 31 days, but Fe
2016-01-27 09:34:57
346
原创 Organize Your Train part II-POJ3007模拟
Organize Your Train part II Time Limit: 1000MS Memory Limit: 65536KDescriptionRJ Freight, a Japanese railroad company for freight operations has recently constructed exchange lines at Hazawa, Yokoh
2016-01-26 20:41:21
1016
原创 Instantaneous Transference--POJ3592Tarjan缩点+搜索
Instantaneous Transference Time Limit: 5000MS Memory Limit: 65536KDescriptionIt was long ago when we played the game Red Alert. There is a magic function for the game objects which is called instan
2016-01-26 16:16:51
625
原创 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 outputBob has a favorite number k and ai of length n.
2016-01-26 10:38:29
2789
原创 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 (1 ≤ M ≤ 12; 1 ≤ N ≤ 12) square parcels. He wants to grow s
2016-01-25 19:49:24
663
原创 有向图的强连通分量的求解算法Tarjan
Tarjan算法Tarjan算法是基于dfs算法，每一个强连通分量为搜索树中的一颗子树。搜索时，把当前搜索树中的未处理的结点加入一个栈中，回溯时可以判断栈顶到栈中的结点是不是在同一个强连通分量中。当dfn[u]=low[u]时，以u为根的搜索子树上的所有结点是一个强连通分量，其中dfn[]值表示结点的深度优先数，low[]值表示结点可以到达的优先数最小的祖先。Tarjan伪代码如下：Tarjan(u
2016-01-24 17:09:28
534
原创 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 had N sons. And there were N beautiful girls in the ki
2016-01-24 16:44:49
598
原创 Father Christmas flymouse--POJ3160Tarjan
Father Christmas flymouse Time Limit: 1000MS Memory Limit: 131072KDescriptionAfter retirement as contestant from WHU ACM Team, flymouse volunteered to do the odds and ends such as cleaning out t
2016-01-24 12:03:50
765
原创 Network of Schools --POJ1236 Tarjan
Network of Schools Time Limit: 1000MS Memory Limit: 10000KDescriptionA number of schools are connected to a computer network. Agreements have been developed among those schools: each school main
2016-01-23 09:19:40
383
原创 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 following (standard) definitions from graph theory. Let V be a
2016-01-22 20:10:50
630
原创 Popular Cows-POJ2186Tarjan
Popular CowsTime Limit: 2000MS Memory Limit: 65536K DescriptionEvery cow's dream is to become the most popular cow in the herd. In a herd of N (1 <= N <= 10,000)
2016-01-22 17:10:22
763
原创 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 DescriptionIn order to make their sons brave, Jiajia and Wind take them to a big cave. Th
2016-01-22 14:37:18
949
原创 Network-POJ3694并查集+LCA
NetworkTime Limit: 5000MS Memory Limit: 65536K DescriptionA network administrator manages a large network. The network consists of N computers and M links bet
2016-01-21 21:31:40
2636
1
原创 Internship-ZOJ2532(网络流求割边)
InternshipTime Limit: 5 Seconds Memory Limit: 32768 KB CIA headquarter collects data from across the country through its classified network. They have been usingoptical fibres long befo
2016-01-21 14:23:58
894
8
原创 Redundant Paths-POJ3177（并查集+双连通分量）
Redundant PathsDescriptionIn order to get from one of the F (1 <= F <= 5,000) grazing fields (which are numbered 1..F) to another field, Bessie and the rest of the herd are forced to cross n
2016-01-11 10:31:29
718
原创 Knights of the Round Table-POJ2942（双连通分量+交叉染色）
Knights of the Round TableDescriptionBeing a knight is a very attractive career: searching for the Holy Grail, saving damsels in distress, and drinking with the other knights are fun things
2016-01-10 17:22:20
474
原创 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 connected by M bridges. All bridges are very beautiful and are l
2016-01-09 20:05:54
637
原创 Cable TV Network-POJ1966图的连通度
Cable TV Network Time Limit: 1000MS Memory Limit: 30000K Total Submissions: 4404 Accepted: 2047 DescriptionThe interconnection of the relays in a cable TV network is bi-directional. Th
2016-01-09 16:45:47
700
OCLSDKLightAMD.zip
2019-10-15
ZOJ2676最小割01规划问题
2016-02-25
最小割在图论中的应用问题
2016-02-24
TA创建的收藏夹 TA关注的收藏夹
TA关注的人