hdu 5908 模拟

链接：戳这里

Abelian Period

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 262144/131072 K (Java/Others)

Problem Description
Let S be a number string, and occ(S,x) means the times that number x occurs in S.

i.e. S=(1,2,2,1,3),occ(S,1)=2,occ(S,2)=2,occ(S,3)=1.

String u,w are matched if for each number i, occ(u,i)=occ(w,i) always holds.

i.e. (1,2,2,1,3)≈(1,3,2,1,2).

Let S be a string. An integer k is a full Abelian period of S if S can be partitioned into several continous substrings of length k, and all of these substrings are matched with each other.

Now given a string S, please find all of the numbers k that k is a full Abelian period of S.
 
Input
The first line of the input contains an integer T(1≤T≤10), denoting the number of test cases.

In each test case, the first line of the input contains an integer n(n≤100000), denoting the length of the string.

The second line of the input contains n integers S1,S2,S3,...,Sn(1≤Si≤n), denoting the elements of the string.
 
Output
For each test case, print a line with several integers, denoting all of the number k. You should print them in increasing order.
 
Sample Input
2
6
5 4 4 4 5 4
8
6 5 6 5 6 5 5 6
 
Sample Output
3 6
2 4 8

思路：

枚举$k$，首先$k$必须是$n$的约数，然后就能算出每个数字应该出现多少次，$O(n)$检验即可。

代码：

#include <iostream>
#include <algorithm>
#include <cstdio>
#include <vector>
#include <cstring>
#include <map>
using namespace std;
int a[100100];
vector<int> V[100100];
int anw[100100],cnt;
int T,n;
struct node{
    int v,num;
}tmp[100100];
map<int,int> mp;
map<int,int> mp2;
void solve(int k,int len){
    mp.clear();
    for(int i=0;i<len;i++) {
        mp[a[i]]++;
    }
    int num=0;
    for(auto & t : mp){
        tmp[num].v=t.first;
        tmp[num].num=t.second;
        num++;
    }
    int flag=0;
    for(int i=len;i<n;i+=len){
        mp2.clear();
        for(int j=i;j<i+len;j++) mp2[a[j]]++;
        int j=0;
        for(auto & t : mp2){
            if(t.first!=tmp[j].v||t.second!=tmp[j].num){
                flag=1;
                break;
            }
            j++;
        }
        if(flag) break;
    }
    if(!flag) anw[++cnt]=len;
}
int main(){
    scanf("%d",&T);
    while(T--){
        scanf("%d",&n);cnt=0;
        memset(anw,0,sizeof(anw));
        for(int i=0;i<n;i++) scanf("%d",&a[i]);
        anw[++cnt]=n;
        for(int k=1;k<n;k++){
            if(n%k==0) solve(n/k,k);
        }
        sort(anw+1,anw+cnt+1);
        printf("%d",anw[1]);
        for(int i=2;i<=cnt;i++) printf(" %d",anw[i]);
        printf("\n");
    }
    return 0;
}