xiji333的博客

https://www.lydsy.com/JudgeOnline/problem.php?id=2152思路：其实就是求满足两点之间的路径长为333的倍数的点对数，算是点分治的模板题。注意(x,y)(x,y)(x,y)和(y,x)(y,x)(y,x)算做两次，且同一个点可以同时被选中。#include<bits/stdc++.h>#define INF 0x3f3f3f3f...

http://poj.org/problem?id=1741题目大意：给一棵树，问有多少对点对(x,y)(x,y)(x,y)满足树上从xxx到yyy的距离<=k<=k<=k。(x,y)(x,y)(x,y)和(y,x)(y,x)(y,x)认为是同一对对点。思路：点分治模板题 。#include<cstdio>#include<cstring>...

http://poj.org/problem?id=2114题目大意：题面太长懒得放了，其实和洛谷点分治模板题是差不多的。#include<cstdio>#include<cstring>#include<algorithm>#define INF 0x3f3f3f3fusing namespace std;typedef long long l...

推荐博客：这一个讲的比较详细，很适合初学者看。https://blog.youkuaiyun.com/a_forever_dream/article/details/81778649这一个写的也很好，有时间复杂度的证明。https://www.cnblogs.com/bztMinamoto/p/9489473.html点分治：本文以洛谷P3806作为例题来讲述一下点分治的思想。同时对推荐的第一篇博...