Codeforces Round #215 (Div. 1) B

出来冒个泡

由于数比较大  开了map计数  然后边走边删边加 勉强可过

#include <iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<stdlib.h>
#include<queue>
#include<map>
#include<string>
using namespace std;
#define LL long long
#define N 200010
int a[N],b[N],ff[N],o[N],g,vis[N];
map<int,int>f;
map<int,int>q;
map<int,int>qq;
int main()
{
    int i,kq=0;
    LL n,m,p;
    cin>>n>>m>>p;
    for(i = 1; i <= n ; i++)
    cin>>a[i];
    for(i = 1; i <= m ; i++)
    {
        cin>>b[i];
        if(!q[b[i]]) kq++;
        q[b[i]]++;
    }
    int k = 0;
    for(int e = 1; e <= n ; e++)
    {
        if(vis[e]) continue;
        if(e+(m-1)*p>n) break;
        k = 0;
        f.clear();qq.clear();
        while(k<m&&e+k*p<=n)
        {
            f[a[e+k*p]]++;
            vis[e+k*p] = 1;
            k++;
        }
        int s=0;
        for(i = 1; i <= m ; i++)
        {
            if(f[b[i]]==q[b[i]]&&!qq[b[i]])
            {
                s++;
                qq[b[i]] = 1;
            }
        }
        if(s==kq)
        {
            g++;
            o[g] = e;
        }
        int j = e+p;
        while(j+(m-1)*p<=n)
        {
            int k1 = f[a[j-p]],k2 = q[a[j-p]],k3 = f[a[j+(m-1)*p]],k4 = q[a[j+(m-1)*p]];
            f[a[j-p]]--;
            f[a[j+(m-1)*p]]++;
            vis[j+(m-1)*p] = 1;
            if(a[j-p]!=a[j+(m-1)*p])
            {
                if(q[a[j-p]])
                {
                   if(k1==k2)
                   s--;
                   else if(f[a[j-p]]==q[a[j-p]]){s++;}
                }
                if(q[a[j+(m-1)*p]])
                {
                    if(k3==k4) s--;
                    else if(f[a[j+(m-1)*p]]==q[a[j+(m-1)*p]]) s++;
                }
            }
            if(s==kq)
            {
               g++;
               o[g] = j;
            }
            j+=p;
        }
    }
    sort(o+1,o+g+1);
    cout<<g<<endl;
    for(i = 1 ; i <= g ; i++)
    cout<<o[i]<<" ";
    return 0;
}