eeeaaaaa的专栏

Proving EquivalencesTime Limit: 4000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3027 Accepted Submission(s): 1133Problem DescriptionConsider th

Summer HolidayTime Limit: 10000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1556 Accepted Submission(s): 714Problem DescriptionTo see a World in

Popular CowsTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 22818 Accepted: 9355DescriptionEvery cow's dream is to become the most popular cow in the herd. In a herd of N (1 <= N <

Intelligence SystemTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1325 Accepted Submission(s): 592Problem DescriptionAfter a day,

Countries in WarTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 2314 Accepted: 721DescriptionIn the year 2050, after different attempts of the UN to maintain peace in the world, th

The King’s ProblemTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 1589 Accepted Submission(s): 572Problem DescriptionIn the Kingd

考研路茫茫——空调教室Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2040 Accepted Submission(s): 604Problem Description众所周知，HDU的考研教室是没有空调的，于

Building roadsTime Limit: 10000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 620 Accepted Submission(s): 174Problem DescriptionFarmer John's farm h

题意：给出一张地图，一只牛可以从高度大的地方走到高处小的地方，高度相同的地方随便走，问最少连接几个块，可以使牛从任何一个点走到任何一个点。。强连通，建图很简单，就是同样高度建个双相边，有高度差是单向边（高度大到高度小），然后tarjan缩点，然后统计缩点之后每个点的入度和出度，统计出度为0和入度为0的点，取这两个中的最大值。。。如果强连通分量只有一个，整张图都是连通的，输出0。。然后就是R