【HDOJ】5908 Abelian Period

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.

Solution

枚举k（k一定是n的约数），直接扫过去，比较相邻两个区间的数字情况（维护数字个数差不为0的个数）。

#include<stdio.h>
#include<cmath>
#include<cstring>
#define N 100003 

int T,n,a[N],D[N];
bool p[N];

inline void work(const int &a)
{
    int lim=(int)sqrt(a);
    for (int i=1;i<=lim;i++) if (a%i==0) p[i]=p[a/i]=1;
}

int main()
{
    scanf("%d",&T);
    while (T--)
    {
        scanf("%d",&n);
        memset(p,0,sizeof(p));
        for (int i=0;i<n;i++) scanf("%d",a+i);
        work(n);
        for (int i=1;i<=n>>1;i++) if (p[i])
        {        
            memset(D,0,sizeof(D));
            bool flag=1;int z=0;
            for (int j=0;j<i;j++)
            {
                if (D[a[j]]==0) z++;if (D[a[j]]==-1) z--;++D[a[j]];    
                if (D[a[j+i]]==0) z++;if (D[a[j+i]]==1) z--;--D[a[j+i]];
            }
            for(int j=i,GG=i;j+i<=n;j++)
            {
                if (j==GG)
                {
                    GG+=i;
                    if (z){flag=0;break;}
                }
                if (D[a[j]]==0) z++;if (D[a[j]]==-1) z--;++D[a[j]];
                if (D[a[j+i]]==0) z++;if (D[a[j+i]]==1) z--;--D[a[j+i]];
            }
            if (flag) printf("%d ",i);
        }
        printf("%d\n",n);
    }
}