Starry

洛谷P3384，树剖板子题，树状数组维护区间操作 #include <bits/stdc++.h> using namespace std; const double eps = 1e-10; const double pi = 3.1415926535897932384626433832795; const double eln = 2.718281828459045235360287471352; #define f(i, a, b) for (int i = a; i <= b; i++) #define

洛谷P3390 #include <bits/stdc++.h> /* #include<ext/pb_ds/assoc_container.hpp> #include<ext/pb_ds/hash_policy.hpp> */ using namespace std; const double eps = 1e-10; const double pi = 3.1415926535897932384626433832795; const double eln 

在此题中。 #include <algorithm> #include <bitset> #include <map> #include <vector> #include <string> #include <cstring> #include <iostream> #include <cmath> #include <stack> #include <set> #include <queue> /* #include<ext/pb_

右上角的元素重要性大于左下角的 int tt, n; struct dsu { dsu(int n) { p.resize(n + 1); s.resize(n + 1); for (int i = 1; i <= n; i++) p[i] = i, s[i] = 1; } vector<int> p, s; int find(int x) { if (x !&