u014681071的博客

/* 线段树离散化 by sbn */#include<iostream>#include<string>#include<cstdio>#include<cstring>#include<cstdlib>#include<algorithm>#include<vector>using namespace std;#define pb push_back#define mp

/* Splay luogu P3391 by sbn 2018-4-2 */ #include&lt;iostream&gt;#include&lt;cstdio&gt;#include&lt;cstdlib&gt;#include&lt;cstring&gt;#include&lt;map&gt;#include&lt;algorithm&gt;#include&lt...

/* P3384 树链剖分 by sbn 2018-3-31 */ #include&lt;iostream&gt;#include&lt;cstdio&gt;#include&lt;cstdlib&gt;#include&lt;algorithm&gt;#include&lt;cstring&gt;#include&lt;queue&gt;#include&lt;vect...

/* Treap luogu3369 by sbn*/#include&lt;iostream&gt;#include&lt;cstdio&gt;#include&lt;cstdlib&gt;#include&lt;ctime&gt;#include&lt;cstring&gt;#include&lt;string&gt;#include&lt;algori...

/*    Segment tree    标记永久化    by sbn    2018-3-30 */ #include&lt;iostream&gt;#include&lt;cstdio&gt;#include&lt;cstdlib&gt;#include&lt;cstring&gt;#include&lt;algorithm&gt;#include&lt;queue&gt;#include...

一、线段树是什么？1.我们为什么要使用线段树？如果只是为了维护一个序列本身，直接用数组就行了，不必使用线段树，就好比能用线段树的时候没必要码个treap上去。线段树的核心作用是维护一个序列的信息，当然这个信息不是什么都行，必须满足区间加法（见ZKW的PPT《统计的力量》）。e.g.可以维护区间和，区间平方和，区间方差等等（都是些基础运用）。2.线段树支持哪些操作？即便是最低级的线段树也应该支持单点...

inline void hash_init(){ Hash.clear(); for (int i=1;i<=n;i++) { Hash.pb(a[i].first); Hash.pb(a[i].first+1); Hash.pb(a[i].second); Hash.pb(a[i].second+1);

/* POJ2299 BIT+逆序对 by sbn 2018-1-12*//* 59105431230*/#include<iostream>#include<cstdio>#include<cstdlib>#include<cstring>#include<vector>#include<algorithm>#define

/* the k-th number 主席树+动态开点 by sbn 2017-12-26 */#include<iostream>#include<cstdio>#include<cstdlib>#include<cstring>#include<string>using namespace std;typedef long long ll;str

/* BIT by sbn 2017-12-30 P3374*/#include<iostream>#include<cstdio>#include<cstdlib>using namespace std;int C[2000010],n,m;int lowbit(int x){ return x & -x;}int add(int x,in

/* RMQ区间最值 线段树版 by sbn*/#include<iostream>#include<cstdio>using namespace std;int n;int arr[1000001],tree[2000001];void build(int root,int st,int ed){ if (st==ed) tree[root]=

/* 线段树区间乘法+区间加法 by sbn*/#include<iostream>#include<cstdio>using namespace std;typedef long long ll;ll n,m,p,z;ll arr[100001];struct node{ ll l,r; ll sum,add,mul;} tree[

/* 可持久优化线段树 POJ2104 区间第k大值 k-th number by sbn 2017-12-21 */#include<iostream>#include<cstdio>#include<vector>#include<cstdlib>#include<algorithm>using namespace std;typedef long

/* Luogu P1903 数颜色 by sbn 2018-4-25 */#include&lt;iostream&gt;#include&lt;cstdio&gt;#include&lt;cstdlib&gt;#include&lt;algorithm&gt;#include&lt;cstring&gt;#include&lt;queue&gt;#include&lt;...