qq_39921637的博客

链接 /* * @Author: hannibal_lecter * @Date: 2018-09-27 13:55:04 * @Last Modified by: hannibal_lecter * @Last Modified time: 2018-09-27 19:36:02 */ #pragma GCC optimize(2) #include<bits/stdc++.h&g...

地址 int Case = 1, n, m; struct node{ int l, r; ll sum, cnt; }tr[maxn<<5]; int root[maxn], tot; struct date{ int val; int t, flag; bool operator<(const date x)const { return t < x.t; ...

题目地址](https://www.spoj.com/problems/DQUERY/en/) #pragma GCC optimize(2) #include<bits/stdc++.h> using namespace std; #define lowbit(x) ((x)&(-x)) typedef long long ll; const int maxn = 1e5+5...

题目链接 主席树叶子节点维护fa数组，每次的修改操作只会改变一个叶子结点的fa值，所以考虑动态开点。合并的时候启发式合并就行了。 #pragma GCC optimize(2) #include<bits/stdc++.h> using namespace std; #define ft first #define sd second #define all(c) ((c).begin...