并查集
花落留香
超越仅发生在弯道时最省力
展开
-
poj--1611--并查集(路径压缩运用)
The SuspectsTime Limit: 1000MS Memory Limit: 20000KTotal Submissions: 18782 Accepted: 9084DescriptionSevere acute respiratory syndrome (SARS), an atypical pneumonia原创 2013-08-10 10:30:48 · 782 阅读 · 0 评论 -
hdu--1811--并查集。。。半成品
#include#include#define MAX 100000int a[MAX];int find(int k){ while(a[k]!=k){ k=a[k]; } return k;}void marge(int x,int y){ int x1,y1; x1=find(x1); y1=find(y1); if(x1>y1)原创 2013-08-06 12:15:23 · 671 阅读 · 0 评论 -
hdu--1272--并查集(捏个捏个)
小希的迷宫Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 19668 Accepted Submission(s): 6014Problem Description上次Gardon的迷宫城堡小希玩了很久(见Pr原创 2013-08-06 12:13:41 · 731 阅读 · 0 评论 -
hdu--1232--并查集(很好理解)
畅通工程Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 22654 Accepted Submission(s): 11825Problem Description某省调查城镇交通状况,得到现有城镇道路统计原创 2013-08-06 12:00:20 · 650 阅读 · 0 评论