图论
文章平均质量分 76
fengzhizi76506
这个作者很懒,什么都没留下…
展开
-
hduoj2066
一个人的旅行Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 33417 Accepted Submission(s): 11499Problem Description虽然草儿是个路痴(就是在杭电待了一年多,居原创 2016-10-25 00:44:53 · 292 阅读 · 0 评论 -
hduoj1874
畅通工程续Time Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 47823 Accepted Submission(s): 17781Problem Description某省自从实行了很多年的畅通工程计划后,终于修原创 2016-10-25 00:45:42 · 273 阅读 · 0 评论 -
MSTkruskal算法的理解
伪代码:把所有边排序,记第i小的边为e[i](1初始化MST为空初始化联通分量,让每个点自成一个独立的联通分量for(int i = 0;i if(e[i].u和e[i].v不在同一个联通分量){把边e[i]加入MST合并e[i].u和e[i].v的联通分量}首先把所有边按照权值排序,找到最小的权值所在的边,用这些点构造联通图可以保证图的权值最小。然后依次搜原创 2016-10-26 00:04:55 · 1323 阅读 · 0 评论 -
hduoj1879
继续畅通工程Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 22411 Accepted Submission(s): 9572Problem Description省政府“畅通工程”的目标是使全省任何两个村庄原创 2016-10-26 00:32:47 · 206 阅读 · 0 评论 -
hduoj1863 今晚和联通杠定了
畅通工程Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 26708 Accepted Submission(s): 11675Problem Description省政府“畅通工程”的目标是使全省任何两个村庄间原创 2016-10-26 00:53:55 · 344 阅读 · 0 评论 -
hduoj 1083 二分图的匹配,匈牙利算法
CoursesProblem DescriptionConsider a group of N students and P courses. Each student visits zero, one or more than one courses. Your task is to determine whether it is possible to form a commi原创 2016-12-15 20:52:39 · 299 阅读 · 0 评论 -
hduoj 1116 并查集+欧拉回路
Play on WordsTime Limit: 10000/5000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 7807 Accepted Submission(s): 2681Problem DescriptionSome of the sec原创 2016-12-18 19:34:29 · 311 阅读 · 0 评论 -
hduoj1233 kruskal
还是畅通工程Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 41163 Accepted Submission(s): 18782Problem Description某省调查乡村交通状况,得到的统计表中列出了原创 2016-10-25 23:09:50 · 268 阅读 · 0 评论