图论 - 随笔分类(第2页) - Billyshuai

ZOJ2532判断边是否是割集中的边

摘要：CIA headquarter collects data from across the country through its classified network. They have been using optical fibres long before it's been deploy 阅读全文

posted @ 2017-08-31 11:50 Billyshuai 阅读(172) 评论(0) 推荐(0)

poj2391 最大流+拆点+二分答案+Floyd

摘要：Ombrophobic Bovines Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 19553 Accepted: 4217 Description FJ's cows really hate getting wet so m 阅读全文

posted @ 2017-08-12 23:18 Billyshuai 阅读(123) 评论(0) 推荐(0)

poj1966枚举源汇点求最小点割DInic

摘要：Cable TV Network Time Limit: 1000MS Memory Limit: 30000K Total Submissions: 4854 Accepted: 2241 Description The interconnection of the relays in a cab 阅读全文

posted @ 2017-08-12 21:42 Billyshuai 阅读(147) 评论(0) 推荐(0)

poj1149 经典建模

摘要：   http://wenku.baidu.com/view/0ad00abec77da26925c5b01c.html 以上内容均为转载阅读全文

posted @ 2017-08-09 13:26 Billyshuai 阅读(146) 评论(0) 推荐(0)

poj2112 网络流+二分答案

摘要：Optimal Milking Time Limit: 2000MS Memory Limit: 30000K Total Submissions: 18083 Accepted: 6460 Case Time Limit: 1000MS Description FJ has moved his K 阅读全文

posted @ 2017-08-09 10:48 Billyshuai 阅读(162) 评论(0) 推荐(0)

hdu6090 菊花图

摘要：Rikka with Graph Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 239 Accepted Submission(s): 157 阅读全文

posted @ 2017-08-08 20:59 Billyshuai 阅读(239) 评论(0) 推荐(0)

poj 2296

摘要：Map Labeler Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 2047 Accepted: 682 Description Map generation is a difficult task in cartograph 阅读全文

posted @ 2017-08-07 22:30 Billyshuai 阅读(128) 评论(0) 推荐(0)

poj3683 2-SAT 同上一道

摘要：Priest John's Busiest Day Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 10151 Accepted: 3475 Special Judge Description John is the only p 阅读全文

posted @ 2017-08-07 19:48 Billyshuai 阅读(158) 评论(0) 推荐(0)

poj3648 2-SAT进阶记录点拓扑

摘要：Wedding Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 10556 Accepted: 3220 Special Judge Description Up to thirty couples will attend a w 阅读全文

posted @ 2017-08-07 15:25 Billyshuai 阅读(144) 评论(0) 推荐(0)

2-SAT poj3207将边看做点

摘要：Ikki's Story IV - Panda's Trick Time Limit: 1000MS Memory Limit: 131072K Total Submissions: 10238 Accepted: 3762 Description liympanda, one of Ikki’s 阅读全文

posted @ 2017-08-06 16:05 Billyshuai 阅读(135) 评论(0) 推荐(0)

poj3694 连通无向图图加边后有多少桥

摘要：Network Time Limit: 5000MS Memory Limit: 65536K Total Submissions: 10261 Accepted: 3807 Description A network administrator manages a large network. T 阅读全文

posted @ 2017-08-04 13:44 Billyshuai 阅读(143) 评论(0) 推荐(0)

poj3687拓扑排序

摘要：Labeling Balls Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 14749 Accepted: 4325 Description Windy has N balls of distinct weights from 阅读全文

posted @ 2017-08-04 11:35 Billyshuai 阅读(157) 评论(0) 推荐(0)

poj3249 拓扑找最长路

摘要：Test for Job Time Limit: 5000MS Memory Limit: 65536K Total Submissions: 11230 Accepted: 2651 Description Mr.Dog was fired by his company. In order to 阅读全文

posted @ 2017-08-02 16:30 Billyshuai 阅读(141) 评论(0) 推荐(0)

poj3177 无向连通图加多少条边变成边双连通图

摘要：Redundant Paths Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 15752 Accepted: 6609 Description In order to get from one of the F (1 <= F 阅读全文

posted @ 2017-08-02 15:24 Billyshuai 阅读(374) 评论(0) 推荐(0)

poj2914无向图的最小割

摘要：http://blog.csdn.net/vsooda/article/details/7397449 //算法理论 http://www.cnblogs.com/ylfdrib/archive/2010/08/17/1801784.html http://blog.csdn.net/i_love_ 阅读全文

posted @ 2017-07-30 23:53 Billyshuai 阅读(699) 评论(0) 推荐(1)

hdu3861他的子问题是poj2762二分匹配+Tarjan+有向图拆点其实就是求DAG的最小覆盖点

摘要：The King’s Problem Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 3120 Accepted Submission(s): 1 阅读全文

posted @ 2017-07-30 22:57 Billyshuai 阅读(249) 评论(0) 推荐(0)

poj2762 判断一个图中任意两点是否存在可达路径也可看成DAG的最小覆盖点是否为1

摘要：Going from u to v or from v to u? Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 17993 Accepted: 4816 Description In order to make their s 阅读全文

posted @ 2017-07-30 22:34 Billyshuai 阅读(421) 评论(0) 推荐(0)

Havel定理 poj1659

摘要：http://blog.csdn.net/xcszbdnl/article/details/14174669 代码风格这里的 Frogs' Neighborhood Time Limit: 5000MS Memory Limit: 10000K Total Submissions: 9953 Acc 阅读全文

posted @ 2017-07-30 15:31 Billyshuai 阅读(144) 评论(0) 推荐(0)

有向图变为强连通图 hdu2767

摘要：Proving Equivalences Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 7346 Accepted Submission(s): 阅读全文

posted @ 2017-07-30 13:28 Billyshuai 阅读(221) 评论(0) 推荐(0)

强连通反向建图 hdu3639

摘要：Hawk-and-Chicken Time Limit: 6000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3321 Accepted Submission(s): 104 阅读全文

posted @ 2017-07-30 13:07 Billyshuai 阅读(256) 评论(0) 推荐(0)

Billyshuai

随笔分类 - 图论

公告