摘要:
解题思路:将给出的男孩的关系合并后,另用一个数组a记录以find(i)为根节点的元素的个数,最后找出数组a的最大值More is betterTime Limit: 5000/1000 MS (Java/Others) Memory Limit: 327680/102400 K (Java/Othe... 阅读全文
摘要:
解题思路:和畅通工程类似,问最后还剩下几个不连通的区域。How Many TablesTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 15086... 阅读全文
摘要:
解题思路:排序后贪心,和fatmouse's trade 类似Saving HDUTime Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 5837 Ac... 阅读全文