借教室 Vijos 1782 NOIP2012 D2T2 Lazy 线段树

怎么说呢，最后一个点跑了1234ms但是vijos没给TLE，我就厚颜无耻地认为自己过了吧！

标准的lazy线段树写法，权当存个模版了！

#	状态	耗时	内存占用
#1	Accepted	4ms	380.0 KiB
#2	Accepted	4ms	348.0 KiB
#3	Accepted	3ms	384.0 KiB
#4	Accepted	4ms	372.0 KiB
#5	Accepted	4ms	360.0 KiB
#6	Accepted	4ms	348.0 KiB
#7	Accepted	42ms	3.219 MiB
#8	Accepted	57ms	3.734 MiB
#9	Accepted	76ms	3.836 MiB
#10	Accepted	96ms	2.375 MiB
#11	Accepted	104ms	2.859 MiB
#12	Accepted	116ms	2.492 MiB
#13	Accepted	150ms	4.25 MiB
#14	Accepted	116ms	3.082 MiB
#15	Accepted	440ms	18.121 MiB
#16	Accepted	619ms	17.84 MiB
#17	Accepted	859ms	17.824 MiB
#18	Accepted	943ms	16.742 MiB
#19	Accepted	1185ms	18.117 MiB
#20	Accepted	1234ms	18.461 MiB

#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cmath>
#include<iostream>
using namespace std;
template<class T> inline void read(T &_a){
    bool f=0;int _ch=getchar();_a=0;
    while(_ch<'0' || _ch>'9'){if(_ch=='-')f=1;_ch=getchar();}
    while(_ch>='0' && _ch<='9'){_a=(_a<<1)+(_a<<3)+_ch-'0';_ch=getchar();}
    if(f)_a=-_a;
}

const int maxn=1000001;
struct fff
{
    int minn,lazy;
}node[(maxn<<2)+(maxn<<1)];
int n,m;

inline void pushup(int u)
{
    node[u].minn=min(node[u<<1].minn,node[u<<1|1].minn);
}

inline void pushdown(int u)
{
    if(node[u].lazy)
    {
        node[u<<1].lazy+=node[u].lazy;
        node[u<<1|1].lazy+=node[u].lazy;
        node[u<<1].minn-=node[u].lazy;
        node[u<<1|1].minn-=node[u].lazy;
        node[u].lazy=0;
    }
}

void build(int u,int l,int r)
{
    if(l==r) { read(node[u].minn); return ; }
    int mid=(l+r)>>1;
    build(u<<1,l,mid);
    build(u<<1|1,mid+1,r);
    pushup(u);
}

int query(int u,int l,int r,int L,int R)
{
    if(L<=l&&r<=R) return node[u].minn;
    pushdown(u);
    int mid=(l+r)>>1;
    if(R<=mid) return query(u<<1,l,mid,L,R);
    if(L>mid) return query(u<<1|1,mid+1,r,L,R);
    return min(query(u<<1,l,mid,L,R),query(u<<1|1,mid+1,r,L,R));
}

void update(int u,int l,int r,int L,int R,int val)
{
    if(L<=l&&r<=R)
    {
        node[u].lazy+=val;
        node[u].minn-=val;
        return ;
    }
    pushdown(u);
    int mid=(l+r)>>1;
    if(L<=mid) update(u<<1,l,mid,L,R,val);
    if(R>mid) update(u<<1|1,mid+1,r,L,R,val);
    pushup(u);
    return ;
}

inline void out()
{
    for (register int i=1;i<=n;++i)
    printf("%d ",query(1,1,n,i,i));putchar('
');
}

int main()
{
    read(n); read(m);
    build(1,1,n);
    // out();
    for (register int cas=1,d,s,j;cas<=m;++cas)
    {
        read(d); read(s); read(j);
        int num=query(1,1,n,s,j);
        // printf("[%d]
",num);
        if(num<d) {printf("-1
%d",cas); return 0;}
        update(1,1,n,s,j,d);
        // out();
    }
    printf("0");
    return 0;
}