E. Painting the Fence

http://codeforces.com/gym/101911/problem/E

题意：给n个初始颜色，m次涂色，每指定一种颜色这种颜色最左到最右染色，问最后的颜色序列；

思路：（1）对每种颜色维护他的下标，每次染色将区间内的下标除去；如果有颜色已经染过就直接跳到该颜色最右；（已经染色过的他的区间内的下标已经清除了所以这个区间必然是被包含的）；

           （2）线段树；

           （3）珂朵莉树；

#include<algorithm>
#include<set>
#include<vector>
#include<queue>
#include<cmath>
#include<cstring>
#include<iostream>
#include<set>
#include<vector>
#include<queue>
#include<cmath>
#include<cstdio>
#include<map>
#include<stack>
#include<string>
using namespace std;

#define sfi(i) scanf("%d",&i)
#define pri(i) printf("%d\n",i)
#define sff(i) scanf("%lf",&i)
#define ll long long
#define mem(x,y) memset(x,y,sizeof(x))
#define INF 0x3f3f3f3f
#define eps 1e-6
#define PI acos(-1)
#define lowbit(x) ((x)&(-x))
#define zero(x) (((x)>0?(x):-(x))<eps)
#define fl() printf("flag\n")
#define MOD(x) ((x%mod)+mod)%mod
#define FASTIO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
ll gcd(ll a,ll b){while(b^=a^=b^=a%=b);return a;}
const int maxn=3e5+9;
const int mod=1e9+7;

template <class T>
inline void sc(T &ret)
{
    char c;
    ret = 0;
    while ((c = getchar()) < '0' || c > '9');
    while (c >= '0' && c <= '9')
    {
        ret = ret * 10 + (c - '0'), c = getchar();
    }
}

set<int>s[maxn];
bool vis[maxn];
int ans[maxn];
int a[maxn];
int main()
{
    int n;
    cin>>n;
    for(int i=1;i<=n;i++)
    {
        cin>>a[i];
        s[a[i]].insert(i);
    }
    int m;
    cin>>m;
    while(m--)
    {
        int x;
        cin>>x;
        if(vis[x]||s[x].size()<2)
        {
            continue;
        }
        int l=*s[x].begin();
        int r=*s[x].rbegin();
        for(int j=l+1;j<=r-1;j++)
        {
            s[a[j]].erase(j);
            if(vis[a[j]]&&s[a[j]].size()>0)//必定是包含整个区间的
            {
                j=*s[a[j]].begin();
                s[a[j]].erase(j);
            }
        }
        vis[x]=1;
    }
    for(int i=1;i<=n;i++)
    {
        if(vis[a[i]]&&s[a[i]].size()>1)
        {
            int l=*s[a[i]].begin();
            int r=*s[a[i]].rbegin();
            for(int j=l;j<=r;j++)
            {
                ans[j]=a[i];
            }
            i=r;
        }
        else ans[i]=a[i];
    }
    for(int i=1;i<=n;i++)
    {
        cout<<ans[i]<<" ";
    }
    return 0;
}

#include<algorithm>
#include<set>
#include<vector>
#include<queue>
#include<cmath>
#include<cstring>
#include<iostream>
#include<set>
#include<vector>
#include<queue>
#include<cmath>
#include<cstdio>
#include<map>
#include<stack>
#include<string>
using namespace std;

#define sfi(i) scanf("%d",&i)
#define pri(i) printf("%d\n",i)
#define sff(i) scanf("%lf",&i)
#define ll long long
#define mem(x,y) memset(x,y,sizeof(x))
#define INF 0x3f3f3f3f
#define eps 1e-6
#define PI acos(-1)
#define lowbit(x) ((x)&(-x))
#define zero(x) (((x)>0?(x):-(x))<eps)
#define fl() printf("flag\n")
#define MOD(x) ((x%mod)+mod)%mod
#define FASTIO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
ll gcd(ll a,ll b){while(b^=a^=b^=a%=b);return a;}
const int maxn=3e5+9;
const int mod=1e9+7;

template <class T>
inline void sc(T &ret)
{
    char c;
    ret = 0;
    while ((c = getchar()) < '0' || c > '9');
    while (c >= '0' && c <= '9')
    {
        ret = ret * 10 + (c - '0'), c = getchar();
    }
}

set<int>s[maxn];
//deque<int>q[maxn];
int a[maxn];
struct node
{
    int l,r;
    int col;
}tree[maxn*4];
void build(int l,int r,int rt)
{
    tree[rt].l=l;
    tree[rt].r=r;
    tree[rt].col=0;
    if(l==r)
    {
        tree[rt].col=a[l];
        return ;
    }
    int mid=(l+r)>>1;
    build(l,mid,rt<<1);
    build(mid+1,r,rt<<1|1);
}
void Push(int rt)
{
    if(tree[rt].col!=0)
    {
        tree[rt<<1].col=tree[rt].col;
        tree[rt<<1|1].col=tree[rt].col;
    }
    tree[rt].col=0;
}
void update(int l,int r,int rt,int x)
{
    if(l<=tree[rt].l&&r>=tree[rt].r)
    {
        tree[rt].col=x;
        return ;
    }
    Push(rt);
    int mid=(tree[rt].l+tree[rt].r)>>1;
    if(r<=mid)
    {
        update(l,r,rt<<1,x);
    }
    else if(l>mid)
    {
        update(l,r,rt<<1|1,x);
    }
    else
    {
        update(l,mid,rt<<1,x);
        update(mid+1,r,rt<<1|1,x);
    }
}
int query(int x,int rt)
{
    if(tree[rt].l==tree[rt].r)
    {
        return tree[rt].col;
    }
    Push(rt);
    int mid=(tree[rt].l+tree[rt].r)>>1;
    if(x<=mid)
    {
        return query(x,rt<<1);
    }
    else return query(x,rt<<1|1);
}
int main()
{
    FASTIO;
    #define endl '\n';
    int n;
    cin>>n;
    for(int i=1;i<=n;i++)
    {
        cin>>a[i];
        s[a[i]].insert(i);
        //q[a[i]].push_back(i);
    }
    build(1,n,1);
    int m;
    cin>>m;
    while(m--)
    {
        int x;
        cin>>x;

        if(s[x].size()<2)
        {
            continue;
        }
        int l=*s[x].begin();
        //s[x].erase(l);
        int r=*s[x].rbegin();
        //s[x].erase(r);


        //int l=q[x].front();
        //int r=q[x].back();

        while(query(l,1)!=x&&s[x].size()>0)
        {
            s[x].erase(l);
            l=*s[x].begin();


            /*q[x].pop_front();
            if(q[x].size())
            {
                l=q[x].front();
            }*/
        }
        while(query(r,1)!=x&&s[x].size()>0)
        {
            s[x].erase(r);
            r=*s[x].rbegin();

            /*q[x].pop_back();
            if(q[x].size())
            {
                r=q[x].back();
            }*/
        }
        if(s[x].size()>1)
        {
            update(l,r,1,x);
        }
    }
    for(int i=1;i<=n;i++)
    {
        cout<<query(i,1)<<" ";
    }
    return 0;
}

 

#include<algorithm>
#include<set>
#include<vector>
#include<queue>
#include<cmath>
#include<cstring>
#include<iostream>
#include<set>
#include<vector>
#include<queue>
#include<cmath>
#include<cstdio>
#include<map>
#include<stack>
#include<string>
using namespace std;

#define sfi(i) scanf("%d",&i)
#define pri(i) printf("%d\n",i)
#define sff(i) scanf("%lf",&i)
#define ll long long
#define mem(x,y) memset(x,y,sizeof(x))
#define INF 0x3f3f3f3f
#define eps 1e-6
#define PI acos(-1)
#define lowbit(x) ((x)&(-x))
#define zero(x) (((x)>0?(x):-(x))<eps)
#define fl() printf("flag\n")
#define MOD(x) ((x%mod)+mod)%mod
#define FASTIO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
ll gcd(ll a,ll b){while(b^=a^=b^=a%=b);return a;}
const int maxn=3e5+9;
const int mod=1e9+7;

template <class T>
inline void sc(T &ret)
{
    char c;
    ret = 0;
    while ((c = getchar()) < '0' || c > '9');
    while (c >= '0' && c <= '9')
    {
        ret = ret * 10 + (c - '0'), c = getchar();
    }
}

#define Sit set<node>::iterator
struct node
{
    int l,r;
    mutable int val;   //保证val可变
    node(int L,int R=-1,int v=0):l(L),r(R),val(v){}
    bool operator<(const node & a)const
    {
        return l<a.l;
    }
};
int a[maxn];
deque<int>q[maxn];
set<node>s;
Sit split(int pos)
{
    Sit it=s.lower_bound(node(pos));//找最靠近pos的l
    if(it!=s.end()&&it->l==pos)//pos就是一个区间的l
        return it;
    it--;                      //pos的所在区间进行分裂
    int L=it->l;
    int R=it->r;
    int v=it->val;
    s.erase(it);
    s.insert(node(L,pos-1,v));
    return s.insert(node(pos,R,v)).first;//返回分裂后的右半部分,pos开头的部分
}
void Assign(int l,int r,int v)
{
    Sit itr=split(r+1);
    Sit itl=split(l);
    s.erase(itl,itr); //整个范围删除
    s.insert(node(l,r,v));
}
int query(int pos)
{
    Sit it=s.lower_bound(node(pos));//找最靠近pos的l
    if(it!=s.end()&&it->l==pos)//pos就是一个区间的l
        return it->val;
    it--;
    int v=it->val;
    return v;
}
int main()
{
    FASTIO;
    #define endl '\n';
    int n;
    cin>>n;
    for(int i=1;i<=n;i++)
    {
        cin>>a[i];
        //s[a[i]].insert(i);
        s.insert(node(i,i,a[i]));
        q[a[i]].push_back(i);
    }
    s.insert(node(n+1,n+1,0));
    int m;
    cin>>m;
    while(m--)
    {
        int x;
        cin>>x;
        if(q[x].size()<2)
        {
            continue;
        }
        int l=q[x].front();
        int r=q[x].back();

        while(query(l)!=x&&q[x].size()>0)
        {
            q[x].pop_front();
            if(q[x].size())
            {
                l=q[x].front();
            }
        }
        while(query(r)!=x&&q[x].size()>0)
        {
            q[x].pop_back();
            if(q[x].size())
            {
                r=q[x].back();
            }
        }
        if(q[x].size()>1)
        {
            Assign(l,r,x);
        }
    }
    Sit itl=split(1);
    Sit itr=split(n+1);
    for(;itl!=itr;itl++)
    {
        int len=itl->r-itl->l+1;
        for(int i=0;i<len;i++)
        {
            cout<<itl->val<<" ";
        }
    }
    return 0;
}