![](https://img-blog.csdnimg.cn/20201014180756925.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
图~~~~~~~~~~~~~~
martinue
攻城狮
展开
-
hdu1285(图,拓扑排序)
Description有N个比赛队(1 Input输入有若干组,每组中的第一行为二个数N(1 Output给出一个符合要求的排名。输出时队伍号之间有空格,最后一名后面没有空格。 其他说明:符合条件的排名可能不是唯一的,此时要求输出时编号小的队伍在前;输入数据保证是正确的,即输入数据确保一定能有一个符合要求的排名原创 2015-08-18 19:01:48 · 507 阅读 · 0 评论 -
hdu1690(最短路floyd)
Problem DescriptionBecause of the huge population of China, public transportation is very important. Bus is an important transportation method in traditional public transportation system. And it’s原创 2015-10-15 19:59:14 · 386 阅读 · 0 评论 -
hdu3081(欧拉回路)
Ant TripTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2261 Accepted Submission(s): 878Problem DescriptionAnt Country consis原创 2016-03-15 15:54:16 · 410 阅读 · 0 评论 -
hdu2094(水题)
Description有一群人,打乒乓球比赛,两两捉对撕杀,每两个人之间最多打一场比赛。 球赛的规则如下: 如果A打败了B,B又打败了C,而A与C之间没有进行过比赛,那么就认定,A一定能打败C。 如果A打败了B,B又打败了C,而且,C又打败了A,那么A、B、C三者都不可能成为冠军。 根据这个规则,无需循环较量,或许就能确定冠军。你的任务就是面对一群比赛选手,在经过了若干场撕原创 2015-08-18 19:11:05 · 1131 阅读 · 0 评论 -
poj2230(欧拉回路模板)
WatchcowTime Limit: 3000MS Memory Limit: 65536KTotal Submissions: 6887 Accepted: 3004 Special JudgeDescriptionBessie's been appointed the new watch-cow for原创 2016-04-11 19:54:27 · 1435 阅读 · 6 评论 -
hdu4587(去掉两个点让强连通分量最大)
TWO NODESTime Limit: 24000/12000 MS (Java/Others) Memory Limit: 65535/32768 K (Java/Others)Total Submission(s): 1702 Accepted Submission(s): 530Problem DescriptionSuppose that G原创 2016-05-12 20:17:05 · 777 阅读 · 0 评论 -
poj3694(割边,LCA)
NetworkTime Limit: 5000MS Memory Limit: 65536KTotal Submissions: 8578 Accepted: 3138DescriptionA network administrator manages a large network. The network cons原创 2016-05-11 15:37:03 · 476 阅读 · 0 评论 -
poj1904(强连通分量,缩点)
King's QuestTime Limit: 15000MS Memory Limit: 65536KTotal Submissions: 8460 Accepted: 3087Case Time Limit: 2000MSDescriptionOnce upon a time there lived a原创 2016-05-10 20:19:43 · 977 阅读 · 0 评论 -
cf22E(加最少的边形成强连通图)
E. Schemetime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputTo learn as soon as possible the latest news abou原创 2016-05-06 16:58:34 · 874 阅读 · 0 评论 -
cf22C (构造带割点的图)
DescriptionBob got a job as a system administrator in X corporation. His first task was to connect n servers with the help of m two-way direct connection so that it becomes possible to transmit原创 2016-05-05 11:31:22 · 488 阅读 · 0 评论 -
hdu4635(强连通分量,缩点)
Strongly connectedTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2202 Accepted Submission(s): 916Problem DescriptionGive a s原创 2016-05-04 16:06:27 · 410 阅读 · 0 评论 -
poj1144(求割点)
NetworkTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 11692 Accepted: 5430DescriptionA Telephone Line Company (TLC) is establishing a new telephone c原创 2016-05-04 12:41:54 · 423 阅读 · 0 评论 -
zoj3460(二分图,拆点,二分)
DescriptionYou control N missile launching towers. Every tower has enough missiles, but for each tower only one missile can be launch at the same time. Before the launching, every missile need T1原创 2016-04-25 21:06:50 · 544 阅读 · 0 评论 -
hdu4751(判断二分图)
Divide GroupsTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1856 Accepted Submission(s): 663Problem Description This ye原创 2016-04-18 12:58:12 · 378 阅读 · 0 评论 -
nefu500(二分,最大流)
网购Problem:ATime Limit:3000msMemory Limit:65536KDescription 在这个信息化的时代,网购成为了最流行的购物方式,比起在大街上,顶着烈日寻找需要的商品,大多数人更愿意坐在家里,点击下鼠标,来找到喜欢的商品,并完成购物。尽管网购还有很多安全问题原创 2016-04-15 19:50:41 · 411 阅读 · 0 评论 -
poj1087(最大流)
A Plug for UNIXTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 15470 Accepted: 5248DescriptionYou are in charge of setting up the press room for the i原创 2016-04-13 22:16:18 · 445 阅读 · 0 评论 -
zoj2314(上下界网络流)
Description The terrorist group leaded by a well known international terrorist Ben Bladen is buliding a nuclear reactor to produce plutonium for the nuclear bomb they are planning to create原创 2016-04-13 19:39:54 · 459 阅读 · 0 评论 -
hdu4971(最大流,最大权闭合子图)
A simple brute force problem.Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 618 Accepted Submission(s): 323Problem Description原创 2016-04-12 21:53:35 · 706 阅读 · 0 评论 -
hdu4975(最大流判环)
A simple Gaussian elimination problem.Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 1539 Accepted Submission(s): 483Problem Des原创 2016-04-08 16:44:18 · 478 阅读 · 0 评论 -
hdu4289(拆点最大流)
ControlTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2564 Accepted Submission(s): 1095Problem Description You, the head of原创 2016-04-06 17:37:20 · 412 阅读 · 1 评论 -
hdu5294(最短路+最大流)
Tricks DeviceTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 3095 Accepted Submission(s): 835Problem DescriptionInnocent Wu f原创 2016-04-05 21:45:52 · 819 阅读 · 0 评论 -
hdu4292(最大流)
FoodTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 4415 Accepted Submission(s): 1492Problem Description You, a part-time di原创 2016-04-05 20:00:35 · 473 阅读 · 0 评论 -
uva11478(差分约束,spfa求负环)
UVA - 11478 Halum (最短路应用+二分)Description Problem HHalumTime Limit : 3 seconds You are given a directed graph G(V,E) with a set of vertices and edges.原创 2016-03-29 20:19:42 · 464 阅读 · 0 评论 -
uva11090(二分spfa)
I I U P C 2 0 0 6Problem G: Going in Cycle!!Input: standard inputOutput: standard output You are given a weighted directed graph with n vertices and原创 2016-03-29 11:28:45 · 463 阅读 · 0 评论 -
aoj2249(最短路)
DescriptionKing Mercer is the king of ACM kingdom. There are one capital and some cities in his kingdom. Amazingly, there are no roads in the kingdom now. Recently, he planned to construct roads b原创 2016-03-28 17:03:21 · 508 阅读 · 0 评论 -
poj1062(spfa)
昂贵的聘礼Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 43203 Accepted: 12681Description年轻的探险家来到了一个印第安部落里。在那里他和酋长的女儿相爱了,于是便向酋长去求亲。酋长要他用10000个金币作为聘礼才答应把女儿原创 2016-03-23 16:58:00 · 440 阅读 · 0 评论 -
hdu5137(最短路)
How Many Maos Does the Guanxi WorthTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 512000/512000 K (Java/Others)Total Submission(s): 1608 Accepted Submission(s): 622Problem Descri原创 2016-03-21 16:52:17 · 496 阅读 · 0 评论 -
hdu3829(二分图,最大独立集)
Cat VS DogTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 125536/65536 K (Java/Others)Total Submission(s): 3326 Accepted Submission(s): 1161Problem DescriptionThe zoo have N原创 2016-03-12 17:20:05 · 378 阅读 · 0 评论 -
poj2594(二分图,最小路径覆盖变形)
Treasure ExplorationTime Limit: 6000MS Memory Limit: 65536KTotal Submissions: 7611 Accepted: 3126DescriptionHave you ever read any book about treasure explorati原创 2016-03-11 19:12:07 · 344 阅读 · 0 评论 -
hdu2444(判断二分图)
The Accomodation of StudentsTime Limit: 5000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 4306 Accepted Submission(s): 1975Problem Description原创 2016-03-10 20:56:00 · 423 阅读 · 0 评论 -
hdu1281(二分图,棋子,匈牙利匹配)
棋盘游戏Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 3547 Accepted Submission(s): 2099Problem Description小希和Gardon在玩一个游戏:对一个N*原创 2016-03-10 16:56:17 · 315 阅读 · 0 评论 -
hdu1083(二分图,匈牙利模板题)
CoursesTime Limit: 20000/10000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 5572 Accepted Submission(s): 2688Problem DescriptionConsider a group原创 2016-03-10 10:47:25 · 361 阅读 · 0 评论 -
hdu2063二分图(匈牙利算法模板)
过山车Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 16349 Accepted Submission(s): 7159Problem DescriptionRPG girls今天和大家一起去游乐场玩原创 2016-03-10 10:17:30 · 444 阅读 · 0 评论 -
poj2253(floyd)
FroggerTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 14821 Accepted: 4902DescriptionFreddy Frog is sitting on a stone in the middle of a lake. Sud原创 2016-01-21 16:24:41 · 447 阅读 · 0 评论 -
hdu2680(最短路spfa!此题有重大发现)
Problem DescriptionOne day , Kiki wants to visit one of her friends. As she is liable to carsickness , she wants to arrive at her friend’s home as soon as possible . Now give you a map of the city原创 2015-10-15 18:36:41 · 1468 阅读 · 1 评论 -
hdu1596(最短路变形)
Problem DescriptionXX星球有很多城市,每个城市之间有一条或多条飞行通道,但是并不是所有的路都是很安全的,每一条路有一个安全系数s,s是在 0 和 1 间的实数(包括0,1),一条从u 到 v 的通道P 的安全度为Safe(P) = s(e1)*s(e2)…*s(ek) e1,e2,ek是P 上的边 ,现在8600 想出去旅游,面对这这么多的路,他想找一条最安全的路。但是原创 2015-10-15 16:33:21 · 501 阅读 · 0 评论 -
hdu1874(最短路spfa)
Problem Description某省自从实行了很多年的畅通工程计划后,终于修建了很多路。不过路多了也不好,每次要从一个城镇到另一个城镇时,都有许多种道路方案可以选择,而某些方案要比另一些方案行走的距离要短很多。这让行人很困扰。现在,已知起点和终点,请你计算出要从起点到终点,最短需要行走多少距离。 Input本题目包含多组数据,请处理到文件结束。原创 2015-10-15 15:33:30 · 461 阅读 · 0 评论 -
hdu2112(最短路spfa,trie树)
Problem Description经过锦囊相助,海东集团终于度过了危机,从此,HDU的发展就一直顺风顺水,到了2050年,集团已经相当规模了,据说进入了钱江肉丝经济开发区500强。这时候,XHD夫妇也退居了二线,并在风景秀美的诸暨市浬浦镇陶姚村买了个房子,开始安度晚年了。这样住了一段时间,徐总对当地的交通还是不太了解。有时很郁闷,想去一个地方又不知道应该乘什么公交车,在什么地方转车原创 2015-10-15 15:09:34 · 575 阅读 · 0 评论 -
poj1459(最大流)
DescriptionA power network consists of nodes (power stations, consumers and dispatchers) connected by power transport lines. A node u may be supplied with an amount s(u) >= 0 of power, may produ原创 2015-08-23 12:28:34 · 498 阅读 · 0 评论 -
poj3159(spfa)
DescriptionDuring the kindergarten days, flymouse was the monitor of his class. Occasionally the head-teacher brought the kids of flymouse’s class a large bag of candies and had flymouse distr原创 2015-08-20 19:08:41 · 520 阅读 · 0 评论