![](https://img-blog.csdnimg.cn/20201014180756923.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
并查集
文章平均质量分 80
black_miracle
这个作者很懒,什么都没留下…
展开
-
POJ 1182 并查集
原文章:http://blog.csdn.net/niushuai666/article/details/6981689题目链接:http://poj.org/problem?id=1182解题思路:这道题是并查集题目中的经典。。。而且比普通并查集提高了一个档次,下面在基础并查集的前提上讲解并查集的真正用法。基础回顾:find()函数找根结点的两转载 2016-05-15 00:58:43 · 342 阅读 · 0 评论 -
POJ 1703 并查集
Find them, Catch themTime Limit: 1000MS Memory Limit: 10000K DescriptionThe police office in Tadu City decides to say ends to the chaos, as launch actions to ro原创 2016-05-15 00:59:37 · 240 阅读 · 0 评论 -
Codeforces 741B 并查集+dp
Arpa's weak amphitheater and Mehrdad's valuable Hosestime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputJust t原创 2016-12-07 12:25:05 · 594 阅读 · 0 评论 -
Codeforces 766D 并查集
Mahmoud and a Dictionarytime limit per test4 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputMahmoud wants to write a new dicti原创 2017-02-11 16:03:00 · 573 阅读 · 0 评论 -
Codeforces 776D 并查集
The Door Problemtime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputMoriarty has trapped n people in n distinc原创 2017-02-25 15:42:31 · 880 阅读 · 0 评论 -
Codeforces 788B 想法+并查集
Weird journeytime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputLittle boy Igor wants to become a traveller.原创 2017-03-30 15:17:00 · 602 阅读 · 0 评论 -
HDU 5883 并查集+欧拉路
The Best PathTime Limit: 9000/3000 MS (Java/Others) Memory Limit: 65535/32768 K (Java/Others)Problem DescriptionAlice is planning her travel route in a beautiful valley. In this valley, there are N...原创 2016-09-18 00:37:28 · 331 阅读 · 0 评论 -
codeforces 156D
传送门:https://codeforces.com/contest/156/problem/D题意:给出一些联通块,加最少的边,使得这些连通块连通,问有多少种方案。题解:裸的矩阵树定理。#include<bits/stdc++.h>using namespace std;typedef long long ll;int fa[100005],num[100005]...原创 2019-01-22 12:01:25 · 182 阅读 · 0 评论