![](https://img-blog.csdnimg.cn/20201014180756927.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
并查集
zxiaopp
这个作者很懒,什么都没留下…
展开
-
How Many Tables
How Many TablesTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 16666 Accepted Submission(s): 8167Problem DescriptionToday is原创 2015-04-22 23:22:33 · 451 阅读 · 0 评论 -
POJ 1182 食物链 带权并查集
转载 http://blog.csdn.net/c0de4fun/article/details/7318642/#comments#include #include #include #include //#define INPUT/** Problem:1182 - 食物链,NOI2001 Begin Time:4th/Mar/2012 1:00 p.原创 2015-10-22 15:33:52 · 343 阅读 · 0 评论 -
POJ 1703 Find them, Catch them(带权并查集)
Find them, Catch themTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 37383 Accepted: 11528DescriptionThe police office in Tadu City decides to say end原创 2015-10-23 16:19:25 · 271 阅读 · 0 评论 -
POJ 1611 The Suspects
The SuspectsTime Limit: 1000MS Memory Limit: 20000KTotal Submissions: 28444 Accepted: 13854DescriptionSevere acute respiratory syndrome (SARS), an atypical pneu原创 2015-10-20 10:40:23 · 245 阅读 · 0 评论 -
1102 Constructing Roads
Constructing RoadsTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 15679 Accepted Submission(s): 5970Problem DescriptionThere原创 2015-04-17 18:49:14 · 345 阅读 · 0 评论 -
2473 Junk-Mail Filter
Junk-Mail FilterTime Limit: 15000/8000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 6635 Accepted Submission(s): 2119Problem DescriptionRecogniz原创 2015-04-19 21:21:02 · 468 阅读 · 0 评论 -
利用并查集求最小生成树
畅通工程Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 34203 Accepted Submission(s): 18092Problem Description某省调查城镇交通状况,得到现有城镇道路原创 2015-04-07 12:30:07 · 513 阅读 · 0 评论 -
并查集
并查集是我暑假从高手那里学到的一招,觉得真是太精妙的设计了。以前我无法解决的一类问题竟然可以用如此简单高效的方法搞定。不分享出来真是对不起party了。(party:我靠,关我嘛事啊?我跟你很熟么?)来看一个实例,杭电1232畅通工程 首先在地图上给你若干个城镇,这些城镇都可以看作点,然后告诉你哪些对城镇之间是有道路直接相连的。最后要解决的是整幅图的连通性问题。比如随意给你两个转载 2015-04-07 09:46:16 · 325 阅读 · 0 评论 -
1162 Eddy's picture
Eddy's pictureTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 7570 Accepted Submission(s): 3837Problem DescriptionEddy begins原创 2015-04-11 11:28:23 · 402 阅读 · 0 评论 -
并查集求集合的个数
以前求并查集都不太在乎每个数的根节点,其实并查集最好的就是这个作用。只需要改进一点就行void join(int x,int y){ int fx=find(x); int fy=find(y); if(fx!=fy) { if(fx>fy) pre[fx]=fy; else pr原创 2015-09-22 23:37:13 · 2176 阅读 · 0 评论