CFhM_R's Blog

Problem Description Benny has a spacious farm land to irrigate. The farm land is a rectangle, and is divided into a lot of samll squares. Water pipes are placed in these squares. Different square h

并查集是一种树状数据结构，用来处理不相交的集合的关系，它的查找速度非常快，在并查集中只存在两种关系，要么是属于关系，要么是不想交的补集关系。 并查集有四种基本操作，初始化，查询，合并以及判断是否属于同一集合，可以用数组实现，也可以用指针实现，北理ACM祖传的是数组实现的方法。用数组来完成指向父节点的操作。所以我们首先需要一个数组fa[]来存放各个元素的父亲节点。 void init(int s

Banana Time Limit: 1000MS   Memory Limit: 30000K Total Submissions: 2220   Accepted: 806 Description Consider a tropical forrest, represented as a matrix. The cell from

题目： Dragon Balls Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 5393 Accepted Submission(s): 2036 Problem Description Five

题目：描述：题解：代码：#include <cstdio> #include <cstring> #include <algorithm> using namespace std; const int maxn = 2e5 + 5; int fa[maxn], sum[maxn]; int find(int x) { if(fa[x] == -1) return x; int tmp