CodeForces - 367B Sereja ans Anagrams（队列+map）

最新推荐文章于 2018-12-02 15:44:03 发布

xuejye

最新推荐文章于 2018-12-02 15:44:03 发布

阅读量272

点赞数

分类专栏： stl

本文链接：https://blog.csdn.net/xuejye/article/details/76120657

版权

stl 专栏收录该内容

38 篇文章 0 订阅

订阅专栏

题目链接：http://codeforces.com/problemset/problem/367/B点击打开链接

Sereja has two sequences a and b and number p. Sequence a consists of n integers a1, a2, ..., an. Similarly, sequence b consists of mintegers b1, b2, ..., bm. As usual, Sereja studies the sequences he has. Today he wants to find the number of positions q(q + (m - 1)·p ≤ n; q ≥ 1), such that sequence b can be obtained from sequence aq, aq + p, aq + 2p, ..., aq + (m - 1)p by rearranging elements.

Sereja needs to rush to the gym, so he asked to find all the described positions of q.

Input

The first line contains three integers n, m and p (1 ≤ n, m ≤ 2·105, 1 ≤ p ≤ 2·105). The next line contains n integers a1, a2, ..., an(1 ≤ ai ≤ 109). The next line contains m integers b1, b2, ..., bm (1 ≤ bi ≤ 109).

Output

In the first line print the number of valid qs. In the second line, print the valid values in the increasing order.

        Examples 
      
          input 
        
5 3 1
1 2 3 2 1
1 2 3

          output 
        
2
1 3

          input 
        
6 3 2
1 3 2 2 3 1
1 2 3

          output 
        
2
1 2

一开始想法使用multiset坐但是会超空间

用队列从1~p通过一个队列往后判断如果当前与b数列相等将即将入队的元素跟队首元素进行比较就可

#include <iostream>
#include <queue>
#include <stdio.h>
#include <stdlib.h>
#include <stack>
#include <limits>
#include <string>
#include <string.h>
#include <vector>
#include <set>
#include <map>
#include <algorithm>
#include <math.h>
using namespace std;
map<int ,int> mmap;
map<int ,int>b;
map<int ,int>a;
map<int , int >ans;
map<int ,int > :: iterator it;
int main()
{
    int n;int m;int p;
    scanf("%d%d%d",&n,&m,&p);
    for(int i=1;i<=n;i++)
        scanf("%d",&a[i]);
    for(int i=1;i<=m;i++)
        {
            int mid;
            scanf("%d",&mid);
            b[mid]++;
        }
    for(int i=1;i<=p;i++)
    {
        queue<int > q;
        for(int j=i;j<=n;j+=p)
        {
            if(q.size()<m)
            {
                q.push(j);
                mmap[a[j]]++;
            }
            if(q.size()==m)
            {
                if(mmap==b)
                    ans[q.front()]++;
                mmap[a[q.front()]]--;
                if(!mmap[a[q.front()]])
                    mmap.erase(a[q.front()]);
                q.pop();
            }
        }
        mmap.clear();
    }

        //cout <<endl;
    cout << ans.size()<< endl;
    for(it=ans.begin();it!=ans.end();it++)
        cout << (*it).first <<" ";

}