![](https://img-blog.csdnimg.cn/20201014180756922.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
图论
三茶先生
life is so long,bu needs you to face~
展开
-
hdu2066一个人的旅行
一个人的旅行Time Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64uSubmit StatusDescription虽然草儿是个路痴(就是在杭电待了一年多,居然还会在校园里迷路的人,汗~),但是草儿仍然很喜欢旅行,因为在旅途中 会遇见很多人(白马王子,^0^)原创 2016-09-25 17:28:45 · 239 阅读 · 0 评论 -
最短路径问题
最短路径问题Time Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64uSubmit StatusDescription给你n个点,m条无向边,每条边都有长度d和花费p,给你起点s终点t,要求输出起点到终点的最短距离及其花费,如果最短距离有多条路线,则输出花费最少原创 2016-09-25 17:32:09 · 267 阅读 · 0 评论 -
HDU Today2112
HDU TodayTime Limit:5000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64uSubmit StatusDescription经过锦囊相助,海东集团终于度过了危机,从此,HDU的发展就一直顺风顺水,到了2050年,集团已经相当规模了,据说进入了钱江肉丝经济开发区5原创 2016-09-25 17:36:14 · 222 阅读 · 0 评论 -
poj1847Tram
Tram Time Limit: 1000MS Memory Limit: 30000K Total Submissions: 14404 Accepted: 5322 DescriptionTram network in Zagreb consists of a number of intersections and rails connecting some of原创 2016-10-05 09:48:15 · 220 阅读 · 0 评论 -
poj1511 Invitation Cards
Invitation Cards Time Limit: 8000MS Memory Limit: 262144K Total Submissions: 25846 Accepted: 8568 DescriptionIn the age of television, not many people attend theater performances. Antiqu原创 2016-10-05 10:04:46 · 295 阅读 · 0 评论 -
hdu 1595 find the longest of the shortest
find the longest of the shortest Time Limit: 1000/5000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 3063 Accepted Submission(s): 1116Problem Description Mari原创 2016-10-05 11:09:01 · 226 阅读 · 0 评论 -
POJ 3013 Big Christmas Tree
Big Christmas Tree Time Limit: 3000MS Memory Limit: 131072K Total Submissions: 23525 Accepted: 5104 DescriptionChristmas is coming to KCM city. Suby the loyal civilian in KCM city is pre原创 2016-10-05 11:15:55 · 227 阅读 · 0 评论 -
poj 3463 Sightseeing
Sightseeing Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 6240 Accepted: 2197 DescriptionTour operator Your Personal Holiday organises guided bus trips across the Benelux. Ever原创 2016-10-05 17:30:16 · 232 阅读 · 0 评论 -
pku2914minmum Cut
Pku2914 Minimum Cut 时间限制: 3 Sec内存限制: 512 MB提交: 0解决: 0 提交状态 题目描述 有一个N(<=500)的无向图,求将这个图断成两个联通块需要删除的边的边权和最小值。输入 两个数n,m,然后m个数每行三个数a,b,c,表示a和b这两个点的连系为c (不会重复出现一对a和b,无序)输出一个数表示最小的联系度和(即无向图最小割)样例输入 3 3原创 2016-11-18 22:34:32 · 231 阅读 · 0 评论