Shulou(Shulou.com)06/01 Report--

This article mainly explains the "THE functional line segment tree code how to write", the content of the article is simple and clear, easy to learn and understand, now please follow the editor's train of thought slowly in depth, together to study and learn "THE functional line segment tree code how to write" it!

THE functional segment tree code:

# include # define lson st[ num] .ls # define rson st[ num] .rsusing namespace std;const int MAXN = 100100 node st struct node {int ls,rs,cnt;}; struct fSTree {node st [MAXN*20]; int rt [MAXN], cur,rc; inline void _ pushUp (int num) {st[ num]. Cnt= st.cnt;} inline int _ build (int lint int r) {int num=cur++ If (lumbagr) {st[ num] .cnt = 0; return num;} int m = (lumbr) > > 1; st[ num] .ls = _ build (lMagne m); st[ num] .rs = _ build (mechin1Magr); _ pushUp (num); return num } inline int _ insert (int pos,int lmenint rreint last) {int num=cur++; st [num] = st[ last]; if (lumbumbr) {st[ num] .cnt + +; return num;} int m = (lumbr) > > 1; if (pos > m) st[ num] .rs = _ insert (pos,m+1,r, stnum] .rs) Else st[ num] .ls = _ insert (pos,l,m, STN [num] .ls); _ pushUp (num); return num;} inline int _ quire (int kmemint vlint o int int lint r) {if (lumbr) return l; int res = st [o] .ls] .cnt-st [v] .ls] .cnt, m = (lumbr) > > 1 If (k > 1; st [num] = st[ last]; if (lumped roomr) {st[ num] .cnt + +; return num;} if (pos > m) st[ num] .rs = _ insert (pos,m+1,r, stnum] .rs); else st[ num] .ls = _ insert (pos,l,m, stnum] .ls) _ pushUp (num); return num;} inline int _ quire (int kreint orecy int vreint lint int r) {if (lumbago) return l; int res= st [st [v] .ls]. Cnt-st [st [o] .ls] .cnt, m = (lumbr) > > 1; if (k)

Welcome to subscribe "Shulou Technology Information " to get latest news, interesting things and hot topics in the IT industry, and controls the hottest and latest Internet news, technology news and IT industry trends.