线段树

//线段树，基础模板
#define lson rt<<1
#define rson rt<<1|1

const int MAXN = (int)1e6+7;
int A[MAXN],N;

struct Node{
    int sum;
    int add;
}tree[MAXN<<2];

void PushUp(int rt){tree[rt].sum = tree[lson].sum + tree[rson].sum; }
void Build(int l,int r,int rt){
    if (l == r){
        tree[rt].sum = A[l];
        return ;
    }
    int m = (l+r)>>1;
    Build(l,m,lson);
    Build(m+1,r,lson);
    PushUp(rt);
}

void Update(int L,int C,int l,int r,int rt){
    if (l == r){
        tree[rt].sum += C;
        return ;
    }
    int m = (l+r)>>1;
    if (L <= m) Update(L,C,l,m,lson);
    else        Update(L,C,m+1,r,rson);
    PushUp(rt);
}

void PushDown(int rt,int ln,int rn){
    if (tree[rt].add){
        tree[lson].sum += tree[rt].add*ln;
        tree[rson].sum += tree[rt].add*rn;

        tree[lson].add += tree[rt].add;
        tree[rson].add += tree[rt].add;
        tree[rt].add = 0;
    }
}

void Update(int L,int R,int C,int l,int r,int rt){
    if (L <= l && r <= R){
        tree[rt].sum += C*(r+1-l);
        tree[rt].add += C;
        return ;
    }
    int m = (l+r)>>1;
    PushDown(rt,m+1-l,r-m);
    if (L <= m) Update(L,R,C,l,m,lson);
    if (R >  m) Update(L,R,C,m+1,r,rson);
    PushUp(rt);
}

int Query(int L,int R,int l,int r,int rt){
    if (L <= l && r <= R){
        return tree[rt].sum;
    }
    int m = (l+r)>>1;
    PushDown(rt,m+1-l,r-m);
    int ans = 0;
    if (L <= m) ans = Query(L,R,l,m,lson);
    if (R >  m) ans = Query(L,R,m+1,r,rson);
    return ans;
}

大神链接： 最好的线段树总结

线段树经典例题

比赛例题

B  n个小矮人初始编号是1-n，1 x y，代表x和y交换，2 x y代表询问x x+1...y 这些小矮人是否连续。

Solution 线段树维护区间最大值和最小值，找x到y的最大值和最小值相减，如果长度等于人数，就代表是连续的。

#include <bits/stdc++.h>
#define lson rt<<1
#define rson rt<<1|1
using namespace std;

const int MAXN = (int)2e5+7;
const int INF = 0x3f3f3f3f;
int A[MAXN],N,M;
int NumMax[MAXN<<2],NumMin[MAXN<<2];

void PushUp(int rt){
    NumMax[rt] = max(NumMax[lson],NumMax[rson]);
    NumMin[rt] = min(NumMin[lson],NumMin[rson]);
}

void Build(int l,int r,int rt){
    if (l == r){
        NumMax[rt] = A[l];
        NumMin[rt] = A[l];
        return ;
    }
    int m = (l+r)>>1;
    Build (l,m,lson);
    Build (m+1,r,rson);
    PushUp(rt);
}

void Update(int L,int l,int r,int rt){
    if (l == r){
        NumMax[rt] = A[l];
        NumMin[rt] = A[l];
        return ;
    }
    int m = (l+r)>>1;
    if (m >= L) Update(L,l,m,lson);
    else        Update(L,m+1,r,rson);
    PushUp(rt);
}

int QueryMin(int L,int R,int l,int r,int rt){
    if (L <= l && r <= R){
        return NumMin[rt];
    }
    int m = (l+r)>>1;
    int ans = INF;
    if (m >= L) ans = min(QueryMin(L,R,l,m,lson),ans);
    if (m <  R) ans = min(QueryMin(L,R,m+1,r,rson),ans);
    return ans;
}

int QueryMax(int L,int R,int l,int r,int rt){
    if (L <= l && r <= R){
        return NumMax[rt];
    }
    int m = (l+r)>>1;
    int ans = 0;
    if (m >= L) ans = max(QueryMax(L,R,l,m,lson),ans);
    if (m <  R) ans = max(QueryMax(L,R,m+1,r,rson),ans);
    return ans;
}

int main()
{
    ios::sync_with_stdio(false);

    cin >> N >> M;
    for (int i = 1;i <= N;i ++)A[i] = i;
    Build(1,N,1);

    int qu,x,y;
    while (M --){
        cin >> qu >> x >> y;
        if (qu == 1){
            swap(A[x],A[y]);
            Update(x,1,N,1);
            Update(y,1,N,1);
        }else {
            if (QueryMax(x,y,1,N,1) - QueryMin(x,y,1,N,1) == y-x)cout << "YES" << endl;
            else cout << "NO" << endl;
        }
    }
}