摘要:
可持久化线段树 #include <cstdio> #include <algorithm> using namespace std ; const int maxn=200010; int a[maxn],b[maxn],blen,n,CNT; int sum[maxn<<5],lc[maxn<< 阅读全文
posted @ 2023-06-22 15:00
towboat
阅读(18)
评论(0)
推荐(0)
摘要:
线段树合并板子 #include<iostream> #include<cstring> using namespace std; const int N =5e5+10,M =N*2; int nxt[M],hd[N],all=1,go[M],n,m; int dep[N],f[N][22],fa 阅读全文
posted @ 2023-06-22 01:36
towboat
阅读(17)
评论(0)
推荐(0)