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=;
     LL n,m,p;
     cin>>n>>m>>p;
     for(i = ; i <= n ; i++)
     cin>>a[i];
     for(i = ; i <= m ; i++)
     {
         cin>>b[i];
         if(!q[b[i]]) kq++;
         q[b[i]]++;
     }
     int k = ;
     for(int e = ; e <= n ; e++)
     {
         if(vis[e]) continue;
         if(e+(m-)*p>n) break;
         k = ;
         f.clear();qq.clear();
         while(k<m&&e+k*p<=n)
         {
             f[a[e+k*p]]++;
             vis[e+k*p] = ;
             k++;
         }
         int s=;
         for(i = ; i <= m ; i++)
         {
             if(f[b[i]]==q[b[i]]&&!qq[b[i]])
             {
                 s++;
                 qq[b[i]] = ;
             }
         }
         if(s==kq)
         {
             g++;
             o[g] = e;
         }
         int j = e+p;
         while(j+(m-)*p<=n)
         {
             int k1 = f[a[j-p]],k2 = q[a[j-p]],k3 = f[a[j+(m-)*p]],k4 = q[a[j+(m-)*p]];
             f[a[j-p]]--;
             f[a[j+(m-)*p]]++;
             vis[j+(m-)*p] = ;
             if(a[j-p]!=a[j+(m-)*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-)*p]])
                 {
                     if(k3==k4) s--;
                     else if(f[a[j+(m-)*p]]==q[a[j+(m-)*p]]) s++;
                 }
             }
             if(s==kq)
             {
                g++;
                o[g] = j;
             }
             j+=p;
         }
     }
     sort(o+,o+g+);
     cout<<g<<endl;
     for(i =  ; i <= g ; i++)
     cout<<o[i]<<" ";
     return ;
 }