Zenith_Habitant的博客

题目链接：https://www.luogu.com.cn/problem/P3302 启发式主席树合并基础题目，和启发式并查集方法保持一致，按秩合并即可，该主席树维护的是根节点到树上任意节点的内容，和 count on tree这个题目维护的内容一样，只是在这个题目的基础上加上了启发式合并 //#define LOCAL #include <bits/stdc++.h> using namespace std; #define ll long long #define mem(a, b).

可撤销并查集，采用启发式按秩合并 struct Undo_Dsu { stack <pii> st ; int fa[N] , siz[N] ; void init() { while(!st.empty()) st.pop() ; for (int i = 1 ; i <= n ; i ++) fa[i] = i , siz[i] = 1 ; } int findroot(int x) { .

#include <bits/stdc++.h> using namespace std; #define ll long long #define mem(a, b) memset(a,b,sizeof(a)) #define INF 0x3f3f3f3f #define DBG printf("this is a input\n") #define fi first #defi...

#include <bits/stdc++.h> using namespace std; #define ll long long #define mem(a, b) memset(a,b,sizeof(a)) #define INF 0x3f3f3f3f #define DBG printf("this is a input\n") #define fi first #defi...

#include <bits/stdc++.h> using namespace std; #define ll long long #define mem(a, b) memset(a,b,sizeof(a)) #define INF 0x3f3f3f3f #define DBG printf("this is a input\n") #define fi first #defi...

#include <stdio.h> #include <iostream> #include <string.h> #include <algorithm> #include <queue> #include <set> #include <map> using namespace std; #define ...

#include <bits/stdc++.h> using namespace std; #define ll long long #define mem(a, b) memset(a,b,sizeof(a)) #define INF 0x3f3f3f3f #define DBG printf("this is a input\n") #define fi first #defi...

求出最小生成树，并以“树边”进行倍增，用于维护lca和两点间路径中的某条最大边和次小边，然后暴力枚举非树边，即可获得严格次小生成树，详细见代码 #include <bits/stdc++.h> using namespace std; #define ll long long #define mem(a, b) memset(a,b,sizeof(a)) #define INF ...