hdu 4747 Mex (2013 ACM/ICPC Asia Regional Hangzhou Online）

题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=4747

思路：

比赛打得太菜了，不想写。。。。线段树莽一下

实现代码：

#include<iostream>
#include<cstdio>
#include<map>
#include<cmath>
using namespace std;
#define lson l,m,rt<<1
#define rson m+1,r,rt<<1|1
#define mid ll m = (l + r) >> 1
#define ll long long
const ll M = 3e5+;
ll sum[M<<],maxx[M<<],lazy[M<<],a[M],mex[M],n,Next[M];
map<ll,ll>mp;
void pushup(ll rt){
    sum[rt] = sum[rt<<] + sum[rt<<|];
    maxx[rt] = max(maxx[rt<<] , maxx[rt<<|]);
}

void pushdown(ll rt,ll m){
        if(lazy[rt]!=-){
        lazy[rt<<] = lazy[rt];
        lazy[rt<<|] = lazy[rt];
        sum[rt<<] = lazy[rt]*(m-(m>>));
        sum[rt<<|] = lazy[rt]*(m>>);
        maxx[rt<<] = lazy[rt];
        maxx[rt<<|] = lazy[rt];
        lazy[rt] = -;
        }
}

void build(ll l,ll r,ll rt){
    sum[rt] =; maxx[rt] = ;
    lazy[rt] = -;
    if(l == r){
        sum[rt] = mex[l];
        maxx[rt] = mex[l];
        return ;
    }
    mid;
    build(lson); build(rson);
    pushup(rt);
}

/*void ct(ll l,ll r,ll rt){
    if(l == r){
        cout << maxx[rt]<<" ";
        return ;
    }
    mid;
    ct(lson);
    ct(rson);
}*/

void update(ll L,ll R,ll c,ll l,ll r,ll rt){
    if(L <= l&&R >= r){
        lazy[rt] = c;
        maxx[rt] = c;
        sum[rt] = c*(r-l+);
        return ;
    }
    pushdown(rt,r-l+);
    mid;
    //cout<<l<<" "<<r<<" "<<sum[1]<<endl;
    if(L <= m) update(L,R,c,lson);
    if(R > m) update(L,R,c,rson);
    pushup(rt);
}

ll query(ll p,ll l,ll r,ll rt){
    if(l == r) return l;
    pushdown(rt,r-l+);
    mid;
    //cout<<maxx[rt<<1]<<" "<<p<<endl;
    if(maxx[rt<<] > p) return query(p,lson);
    else return query(p,rson);
}

int main()
{
    while(scanf("%I64d",&n)&&n){
        ll tmp = ;
        mp.clear();
        for(ll i = ;i <= n;i ++){
            scanf("%I64d",&a[i]);
            mp[a[i]] = ;
            while(mp.find(tmp) != mp.end()) tmp++;
            mex[i] = tmp;
        }
        mp.clear();
        for(ll i = n;i >= ;i --){
            if(mp.find(a[i]) == mp.end()) Next[i] = n + ;
            else Next[i] = mp[a[i]];
            mp[a[i]] = i;
        }
        build(,n,);
        ll ans = ;
        for(ll i = ;i <= n;i ++){
            ans += sum[];
            if(maxx[] > a[i]){
                ll l = query(a[i],,n,);
                ll r = Next[i];
                //cout<<l<<" "<<r<<endl;
                if(l < r)
                    update(l,r-,a[i],,n,);
            }
            update(i,i,,,n,);
        }
        printf("%I64d\n",ans);
    }
    return ;
}