Longest Subarray

 http://acm.hdu.edu.cn/showproblem.php?pid=6602

标志每种数字对哪个区间贡献不合法标志，查找0的位置

#include <iostream>
#include <cstring>
#include <queue>
#include <vector>
#include <algorithm>
#include <cstdio>
#include <set>
#include <map>
#include <stack>
//#include <tr1/unordered_map>
#include <unordered_map>
#include <cmath>
#include<bits/stdc++.h>
using namespace std;

#define sfi(i) scanf("%d",&i)
#define sfl(i) scanf("%I64d",&i)
#define sfs(i) scanf("%s",(i))
#define pri(i) printf("%d\n",i)
#define prl(i) printf("%I64d\n",i)
#define sff(i) scanf("%lf",&i)
#define ll long long
#define ull unsigned long long
#define uint unsigned int
#define mem(x,y) memset(x,y,sizeof(x))
#define INF 0x3f3f3f3f
#define inf 8e19
#define eps 1e-10
#define PI acos(-1.0)
#define lowbit(x) ((x)&(-x))
#define fl() printf("flag\n")
#define MOD(x) ((x%mod)+mod)%mod
#define endl '\n'
#define pb push_back
#define lson (rt<<1)
#define rson (rt<<1|1)
#define FAST_IO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0)

template<typename T>inline void read(T &x)
{
    x=0;
    static int p;p=1;
    static char c;c=getchar();
    while(!isdigit(c)){if(c=='-')p=-1;c=getchar();}
    while(isdigit(c)) {x=(x<<1)+(x<<3)+(c-48);c=getchar();}
    x*=p;
}

//-----------------------------------------------
const int maxn=5e5+9;
const int maxm=2e5+9;
const int mod=1e9+7;

int a[maxn];
int n,c,k;
int tree[maxn<<2],lazy[maxn<<2];

vector<int> vec[maxn];

void pushdown(int rt)
{
    if(lazy[rt])
    {
        tree[lson]+=lazy[rt];
        tree[rson]+=lazy[rt];
        lazy[lson]+=lazy[rt];
        lazy[rson]+=lazy[rt];
        lazy[rt]=0;
    }
}

void pushup(int rt)
{
    tree[rt]=min(tree[lson],tree[rson]);
}

void update(int L,int R,int val,int l,int r,int rt)
{
    if(l>=L&&R>=r)
    {
        lazy[rt]+=val;
        tree[rt]+=val;
        return ;
    }
    pushdown(rt);
    int mid=(l+r)>>1;
    if(L<=mid) update(L,R,val,l,mid,lson);
    if(R>mid) update(L,R,val,mid+1,r,rson);
    pushup(rt);
}

int query(int l,int r,int rt)
{
    if(l==r)
    {
        return l;
    }
    pushdown(rt);
    int mid=(l+r)>>1;
    if(tree[rt]>0) return n+1;
    else if(tree[lson]==0) return query(l,mid,lson);
    else if(tree[rson]==0) return query(mid+1,r,rson);
}

int main()
{
    FAST_IO;

    //freopen("input.txt","r",stdin);



    while(cin>>n>>c>>k)
    {
        for(int i=0;i<=c;i++) vec[i].clear();
        mem(tree,0);
        mem(lazy,0);

        for(int i=1;i<=c;i++)
            vec[i].pb(0);

        for(int i=1;i<=n;i++) cin>>a[i];

        if(k==1)
        {
            cout<<n<<endl;
            continue;
        }

        int ans=0;
        for(int i=1;i<=n;i++)
        {
            int siz=vec[a[i]].size();
            if(siz>k)
            {
                int l=vec[a[i]][siz-k];
                int r=vec[a[i]].back();
                update(l+1,r,-1,1,n,1);

                vec[a[i]].pb(i);
                siz=vec[a[i]].size();
                l=vec[a[i]][siz-k];
                r=vec[a[i]].back();
                update(l+1,r,1,1,n,1);

            }
            else
            {
                if(siz>1)
                    update(1,vec[a[i]].back(),-1,1,n,1);
                vec[a[i]].pb(i);
                siz=vec[a[i]].size();
                if(siz>k)
                {
                    //cout<<i<<endl;
                    update(vec[a[i]][1]+1,i,1,1,n,1);
                }
                else
                    update(1,i,1,1,n,1);
            }

            //cout<<query(1,n,1)<<endl;

            ans=max(ans,i-query(1,n,1)+1);

        }

        cout<<ans<<endl;

    }

    return 0;
}