并查集
NineFailure
这个作者很懒,什么都没留下…
展开
-
HDU1232并查集
这道题大概就是很裸的并查集了 主要的思路大概就是 并查集一遍 然后找找到底有几个根节点 就可以了#include<iostream>#include<queue>#include<stack>#include<cstdlib>#include<memory.h>using namespace std;int map[10011];int book[10011];int gen原创 2016-07-20 13:25:00 · 291 阅读 · 0 评论 -
HDU1213
并查集超级水题#include<iostream>#include<queue>#include<stack>#include<cstdlib>#include<memory.h>using namespace std;int map[1001];int book[1001];int gen(int x){ while(x!=map[x]) { x=原创 2016-07-20 14:44:20 · 305 阅读 · 0 评论 -
HDU2818加权并查集
Problem Description John are playing with blocks. There are N blocks (1 <= N <= 30000) numbered 1…N。Initially, there are N piles, and each pile contains one block. Then John do some operations P times原创 2016-07-22 09:24:18 · 465 阅读 · 0 评论 -
HDU1856
数据超弱并查集 只要十万就能过#include<iostream>#include<cstdlib>#include<memory.h>#include<map>using namespace std;int dian[100001];int book[100001];int gen(int v) { int t1,t2=v; while(v!=dian[原创 2016-07-22 09:25:46 · 288 阅读 · 0 评论 -
UVA11987 带删除的并查集
第一次做这种并查集… 删除这个动作实在是不好想… 只要坐标超过最大给他个新内存就可以了 原来的地方给他留着用来存以前的集合最大值… 但是位置改到新坐标去 然后属性复制过去就可以了#include<iostream>#include<algorithm>#include<memory.h>#include<cstdio>using namespace std;int n, m;s原创 2016-09-30 17:15:05 · 418 阅读 · 0 评论 -
CodeForces731C 并查集
C. Socks time limit per test2 seconds memory limit per test256 megabytes inputstandard input outputstandard output Arseniy is already grown-up and independent. His mother decided to leave him alon原创 2016-10-18 00:43:37 · 493 阅读 · 0 评论 -
poj3694 LCA+并查集+tarjan求割边
Description A network administrator manages a large network. The network consists of N computers and M links between pairs of computers. Any pair of computers are connected directly or indirectly by s原创 2016-12-05 00:17:38 · 400 阅读 · 0 评论 -
CodeForces741b
Just to remind, girls in Arpa’s land are really nice.Mehrdad wants to invite some Hoses to the palace for a dancing party. Each Hos has some weight wi and some beauty bi. Also each Hos may have some fr原创 2016-12-07 16:59:50 · 601 阅读 · 0 评论