【BZOJ 4293 [PA2015]Siano】 线段树

BZOJ 4293
题意：有一片n亩的土地，上面要种草。每棵草每次长高a[i]厘米
有Q次操作 d v 代表在D时刻的那秒末 减掉所有高度大于v的部分的草
我们怎么做呢？首先要发现一个性质(跪了
就是你先把a[i]排个序 排序好的a[i]无论如何操作 都是单调不减的
那么我们每次只要找到第一个大于v的位置pos pos到n区间覆盖成v即可
然后之前的s[1] 和 区间覆盖后的s[1]之差就是答案
我们这里setv 代表替换标记 col代表懒标记 下传的是时间也就是草长了多少天
区间覆盖和区间加要先覆盖 因为加了再覆盖等同于直接覆盖

/*
    if you can't see the repay
    Why not just work step by step
    rubbish is relaxed
    to ljq
*/
#include <cstdio>
#include <cstring>
#include <iostream>
#include <queue>
#include <cmath>
#include <map>
#include <stack>
#include <set>
#include <sstream>
#include <vector>
#include <stdlib.h>
#include <algorithm>
using namespace std;

#define dbg(x) cout<<#x<<" = "<< (x)<< endl
#define dbg2(x1,x2) cout<<#x1<<" = "<<x1<<" "<<#x2<<" = "<<x2<<endl
#define dbg3(x1,x2,x3) cout<<#x1<<" = "<<x1<<" "<<#x2<<" = "<<x2<<" "<<#x3<<" = "<<x3<<endl
#define max3(a,b,c) max(a,max(b,c))
#define min3(a,b,c) min(a,min(b,c))
#define lc (rt<<1)
#define rc (rt<<11)
#define mid ((l+r)>>1)

typedef pair<int,int> pll;
typedef long long ll;
const int inf = 0x3f3f3f3f;
const int _inf = 0xc0c0c0c0;
const ll INF = 0x3f3f3f3f3f3f3f3f;
const ll _INF = 0xc0c0c0c0c0c0c0c0;
const ll mod =  (int)1e9+7;

ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
ll ksm(ll a,ll b,ll mod){int ans=1;while(b){if(b&1) ans=(ans*a)%mod;a=(a*a)%mod;b>>=1;}return ans;}
ll inv2(ll a,ll mod){return ksm(a,mod-2,mod);}
void exgcd(ll a,ll b,ll &x,ll &y,ll &d){if(!b) {d = a;x = 1;y=0;}else{exgcd(b,a%b,y,x,d);y-=x*(a/b);}}//printf("%lld*a + %lld*b = %lld\n", x, y, d);
const int MAX_N = 500025;
ll maxx[MAX_N<<2],s[MAX_N<<2],setv[MAX_N<<2],col[MAX_N<<2],sum[MAX_N],arr[MAX_N];
ll Max(ll a,ll b){if(a>b) return a;return b;}
void up(int rt)
{
    s[rt] = s[rt<<1] + s[rt<<1|1];
    maxx[rt] = Max(maxx[rt<<1],maxx[rt<<1|1]);
}
void build(int rt,int l,int r)
{
    setv[rt] = -1;col[rt] = s[rt] = maxx[rt] = 0;
    if(l==r)
    {
        return ;
    }
    build(rt<<1,l,mid);
    build(rt<<1|1,mid+1,r);
    up(rt);
}
void down(int rt,int l,int r)
{
    if(setv[rt]!=-1)
    {
        setv[rt<<1] = setv[rt<<1|1] = setv[rt];
        maxx[rt<<1] = maxx[rt<<1|1] = setv[rt];
        s[rt<<1] = 1ll*(mid-l+1)*setv[rt];
        s[rt<<1|1] = 1ll*(r-mid)*setv[rt];
        col[rt<<1] = col[rt<<1|1] = 0;
        setv[rt] = -1;
    }
    if(col[rt])
    {
        maxx[rt<<1] += col[rt]*arr[mid];
        maxx[rt<<1|1] += col[rt]*arr[r];
        s[rt<<1] += col[rt]*(sum[mid]-sum[l-1]);
        s[rt<<1|1] += col[rt]*(sum[r]-sum[mid]);
        col[rt<<1]+=col[rt];
        col[rt<<1|1] += col[rt];
        col[rt] = 0;
    }
}
/*inline void pushnow(int p,ll v){T[p].sum+=v*(sum[T[p].r]-sum[T[p].l-1]),T[p].maxn+=v*a[T[p].r],T[p].lz+=v;}
inline void pushnown(int p,ll v){T[p].bz=v,T[p].lz=0,T[p].sum=(T[p].r-T[p].l+1)*v,T[p].maxn=v;}
inline void pushdown(int p){
    if(T[p].bz!=-1)pushnown(lc,T[p].bz),pushnown(rc,T[p].bz),T[p].bz=-1;
    if(T[p].lz)pushnow(lc,T[p].lz),pushnow(rc,T[p].lz),T[p].lz=0;
}*/
void update(int rt,int l,int r,int x,int y,ll v)
{
    if(x<=l&&r<=y)
    {
        setv[rt] = v;
        maxx[rt] = v;
        s[rt] = 1ll*(r-l+1)*v;
        col[rt] = 0;
        return ;
    }
    down(rt,l,r);
    if(y<=mid) update(rt<<1,l,mid,x,y,v);
    else if(x>mid) update(rt<<1|1,mid+1,r,x,y,v);
    else update(rt<<1,l,mid,x,y,v),update(rt<<1|1,mid+1,r,x,y,v);
    up(rt);
}
int query(int rt,int l,int r,ll v)
{
    if(l==r)
    {
        return l;
    }
    down(rt,l,r);
    if(maxx[rt<<1]>v) return query(rt<<1,l,mid,v);
    else return query(rt<<1|1,mid+1,r,v);
}
int main()
{
    //ios::sync_with_stdio(false);
    //freopen("a.txt","r",stdin);
    //freopen("b.txt","w",stdout);
    int n,Q;
    scanf("%d%d",&n,&Q);
    for(int i = 1;i<=n;++i) scanf("%lld",&arr[i]);
    build(1,1,n);
    sort(arr+1,arr+1+n);
    for(int i = 1;i<=n;++i) sum[i] = sum[i-1] + arr[i];
    ll d1 = 0,d2,v;
    while(Q--)
    {
        scanf("%lld%lld",&d2,&v);
        s[1] += sum[n]*(d2-d1),maxx[1] += (d2-d1)*arr[n],col[1]+=(d2-d1);
        ll tmp = s[1];
        if(maxx[1]<=v) {d1 = d2;printf("0\n");continue;}
        d1 = d2;
        int pos = query(1,1,n,v);
        update(1,1,n,pos,n,v);
        printf("%lld\n",tmp-s[1]);
    }
    //fclose(stdin);
    //fclose(stdout);
    //cout << "time: " << (long long)clock() * 1000 / CLOCKS_PER_SEC << " ms" << endl;
    return 0;
}