并查集
星天93
很多烦恼是我们凭空虚构的,而我们却把它当做真实去承受。
展开
-
hdu3367之并查集
Pseudoforest Time Limit: 10000/5000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others) Total Submission(s): 1026 Accepted Submission(s): 395 Problem Description In graph theory原创 2013-04-22 16:28:57 · 907 阅读 · 0 评论 -
hdu2473之并查集
思路:每次删除一个点a,并不把a从当前集合删除,而是用一个数组node[a]代表a对应的点,所以每次删除a后,node[a]=++n,即开辟一个新的点作为a对应的点,这样就不会影响a这个集合 http://acm.hdu.edu.cn/showproblem.php?pid=2473 #include #include #include #include #include #include #原创 2013-04-19 12:02:29 · 995 阅读 · 0 评论 -
hdu3461之并查集
Code Lock Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 131072/65536 K (Java/Others) Total Submission(s): 722 Accepted Submission(s): 245 Problem Description A lock you use has原创 2013-04-21 21:01:20 · 880 阅读 · 0 评论 -
hdu1829并查集
A Bug's Life Time Limit: 15000/5000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 5567 Accepted Submission(s): 1828 Problem Description Background Pr原创 2013-04-17 13:32:27 · 1249 阅读 · 0 评论 -
hdu3047之并查集
#include #include #include #include #include #include #include #include #include #define INF 99999999 using namespace std; const int MAX=50000+10; const int mod=300; int father[MAX],dist[MAX],sum; v原创 2013-04-19 22:50:02 · 685 阅读 · 0 评论 -
hdu3635之并查集
#include #include #include #include #include #include #include #include #include #include #define INF 99999999 using namespace std; const int MAX=10000+10; /*father[i]表示i节点的父亲,rank[i]i所在集合的元素 sum转换的次原创 2013-04-18 22:51:21 · 778 阅读 · 0 评论 -
hdu2818之并查集
#include #include #include #include #include #include #include #include #include #define INF 99999999 using namespace std; const int MAX=30000+10; int father[MAX],rank[MAX],sum[MAX];//sum[i]表示i下面的积木个原创 2013-04-21 22:22:45 · 1375 阅读 · 2 评论 -
hdu3038之并查集
这题大意是给出多个区间的和,判断数据矛盾的区间有几个,比方说[1,5] = 10 ,[6.10]= 10, [1, 10]= 30,这明显第三个与前面两个矛盾。 #include #include #include #include #include #include #include #include #include #define INF 99999999 using namespa原创 2013-04-20 21:02:24 · 657 阅读 · 0 评论 -
hdu1598之并查集
find the most comfortable road Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 2014 Accepted Submission(s): 844 Problem Description原创 2013-04-21 15:22:49 · 732 阅读 · 0 评论 -
http://codeforces.com/contest/366/problem/D
D. Dima and Trap Graph time limit per test 3 seconds memory limit per test 256 megabytes input standard input output standard output Dima and Inna love spending time tog原创 2013-11-26 21:28:20 · 1749 阅读 · 0 评论