![](https://img-blog.csdnimg.cn/20201014180756916.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
连通
文章平均质量分 81
eeeaaaaa
这个作者很懒,什么都没留下…
展开
-
HDU2767 Proving Equivalences
Proving Equivalences Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 3027 Accepted Submission(s): 1133 Problem Description Consider th原创 2014-07-25 13:27:48 · 321 阅读 · 0 评论 -
HDU1827 Summer Holiday
Summer Holiday Time Limit: 10000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 1556 Accepted Submission(s): 714 Problem Description To see a World in原创 2014-07-25 21:40:25 · 423 阅读 · 0 评论 -
POJ2186 Popular Cows
Popular Cows Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 22818 Accepted: 9355 Description Every cow's dream is to become the most popular cow in the herd. In a herd of N (1 <= N <原创 2014-07-26 15:54:18 · 279 阅读 · 0 评论 -
HDU3072 Intelligence System
Intelligence System Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 1325 Accepted Submission(s): 592 Problem Description After a day,原创 2014-07-26 18:54:10 · 387 阅读 · 0 评论 -
POJ3114 Countries in War
Countries in War Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 2314 Accepted: 721 Description In the year 2050, after different attempts of the UN to maintain peace in the world, th原创 2014-07-27 18:04:27 · 325 阅读 · 0 评论 -
HDU3861 The King’s Problem
The King’s Problem Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 1589 Accepted Submission(s): 572 Problem Description In the Kingd原创 2014-07-27 13:18:31 · 401 阅读 · 0 评论 -
HDU2242 考研路茫茫——空调教室
考研路茫茫——空调教室 Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 2040 Accepted Submission(s): 604 Problem Description 众所周知,HDU的考研教室是没有空调的,于原创 2014-07-28 21:05:02 · 1254 阅读 · 0 评论 -
HDU1815 Building roads
Building roads Time Limit: 10000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 620 Accepted Submission(s): 174 Problem Description Farmer John's farm h原创 2014-08-17 13:15:41 · 441 阅读 · 0 评论 -
POJ2375 Cow Ski Area
题意:给出一张地图,一只牛可以从高度大的地方走到高处小的地方,高度相同的地方随便走,问最少连接几个块,可以使牛从任何一个点走到任何一个点。。 强连通,建图很简单,就是同样高度建个双相边,有高度差是单向边(高度大到高度小),然后tarjan缩点,然后统计缩点之后每个点的入度和出度,统计出度为0和入度为0的点,取这两个中的最大值。。。如果强连通分量只有一个,整张图都是连通的,输出0。。 然后就是R原创 2014-12-01 18:44:21 · 375 阅读 · 0 评论