NOIP 模板整理（多图预警╮(╯▽╰)╭）

马上就要考NOIP了，是时候整理一下模板了233

线段树模板

区间修改+区间求和：

#include<cstdio>
#include<cstring>
#include<iostream>
using namespace std;
long long xl[233333];
struct jgt
{
    int l,r;
    long long sum,add;
}hah[233333*4];
void build(int p,int l,int r)
{
    hah[p].l=l;
    hah[p].r=r;
    if(l==r)
    {
        hah[p].sum=xl[l];
        return ;
    }
    int mid=(l+r)/2;
    build(p*2,l,mid);
    build(p*2+1,mid+1,r);
    hah[p].sum=hah[p*2].sum+hah[p*2+1].sum;
}
void spread(int p)
{
    if(hah[p].add)
    {
        hah[p*2].sum+=(hah[p*2].r-hah[p*2].l+1)*hah[p].add;
        hah[p*2+1].sum+=(hah[p*2+1].r-hah[p*2+1].l+1)*hah[p].add;
        hah[p*2].add+=hah[p].add;
        hah[p*2+1].add+=hah[p].add;
        hah[p].add=0;
    }
}
long long ask(int p,int l,int r)
{
    if(l<=hah[p].l&&hah[p].r<=r)
    {
        return hah[p].sum;
    }
    spread(p);
    long long ans=0;
    int mid=(hah[p].l+hah[p].r)/2;
    if(l<=mid) ans+=ask(p*2,l,r);
    if(mid<r) ans+=ask(p*2+1,l,r);
    return ans;
}
void change(int p,int l,int r,long long x)
{
    if(l<=hah[p].l&&hah[p].r<=r)
    {
        hah[p].sum+=(hah[p].r-hah[p].l+1)*x;
        hah[p].add+=x;
        return ;
    }
    spread(p);
    int mid=(hah[p].l+hah[p].r)/2;
    if(l<=mid) change(p*2,l,r,x);
    if(mid<r) change(p*2+1,l,r,x);
    hah[p].sum=hah[p*2].sum+hah[p*2+1].sum;
}
int main()
{
    int n,q;
    scanf("%d",&n);
    for(int i=1;i<=n;i++)
        scanf("%lld",&xl[i]);
    build(1,1,n);
    scanf("%d",&q);
    for(int i=1;i<=q;i++)
    {
        int u;
        scanf("%d",&u);
        if(u==1)
        {
            int a,b;
            long long x;
            scanf("%d%d%lld",&a,&b,&x);
            change(1,a,b,x);
        }
        if(u==2)
        {
            int a,b;
            scanf("%d%d",&a,&b);
            printf("%lld\n",ask(1,a,b));
        }
    }
    return 0;
}

询问区间最值：

#include<cstdio>
#include<cstring>
#include<iostream>
using namespace std;
const int MAXN=233333;
int xl[MAXN];
struct jgt
{
    int l,r,maxx,minn;
}hah[MAXN<<2];
void updata(int p)
{
    hah[p].maxx=max(hah[p<<1].maxx,hah[p<<1|1].maxx);
    hah[p].minn=min(hah[p<<1].minn,hah[p<<1|1].minn);
}
void build(int p,int l,int r)
{
    hah[p].l=l;
    hah[p].r=r;
    if(l==r)
    {
        hah[p].maxx=hah[p].minn=xl[l];
        return ;
    }
    int mid=(l+r)>>1;
    build(p<<1,l,mid);
    build(p<<1|1,mid+1,r);
    updata(p);
}
int askmax(int p,int l,int r)
{
    if(l<=hah[p].l&&hah[p].r<=r)
        return hah[p].maxx;
    int mid=(hah[p].l+hah[p].r)>>1;
    int ans=0;
    if(l<=mid) ans=max(ans,askmax(p<<1,l,r));
    if(mid<r) ans=max(ans,askmax(p<<1|1,l,r));
    return ans;
}
int askmin(int p,int l,int r)
{
    if(l<=hah[p].l&&hah[p].r<=r)
        return hah[p].minn;
    int mid=(hah[p].l+hah[p].r)>>1;
    int ans=233333333;
    if(l<=mid) ans=min(ans,askmin(p<<1,l,r));
    if(mid<r) ans=min(ans,askmin(p<<1|1,l,r));
    return ans;
}
int main()
{
    int n;
    scanf("%d",&n);
    for(int i=1;i<=n;i++)
        scanf("%d",&xl[i]);
    build(1,1,n);
    printf("%d %d\n",askmax(1,1,n),askmin(1,1,n));
    return 0;
}