HDU 5908 Abelian Period（暴力）

大大体题意：

给你n 个数字，要求分成k 个连续区间，使得k 个区间数的种类和数量完全一样，求所有的k？

思路：

直接暴力：

枚举k ，1~n/2

如果n能整除k  在处理，

否则一个区间一个区间排序即可！

不能所有区间一次性全排序，会超时！

#include <cstdio>
#include <cstring>
#include <algorithm>
#include <vector>
using namespace std;
const int maxn = 100000 + 10;
int a[maxn],b[maxn];
int n;
vector<int>ans;
bool solve(int x){
    memcpy(b,a,sizeof b);
//    for (int i = 1; i < n; i += x){
        sort(b+1,b+1+x);
//    }
    for (int i = 1; i < n/x; ++i){
        sort(b+i*x+1,b+i*x+x+1);
        for (int j = 1; j <= x; ++j){
            if (b[i*x+j] != b[j])return 0;
        }
    }
    return 1;
}
int main(){
    int T;
    scanf("%d",&T);
    while(T--){
        ans.clear();
        scanf("%d",&n);
        for (int i = 1; i <= n; ++i){
            scanf("%d",&a[i]);
        }
        for (int i = 1; i <= n/2; ++i){
            if (n % i == 0){
                if (solve(i))ans.push_back(i);
            }
        }
        ans.push_back(n);
        sort(ans.begin(),ans.end());
        int len = ans.size();
        for (int i = 0; i < len; ++i){
            if (i)printf(" ");
            printf("%d",ans[i]);
        }
        puts("");
    }

    return 0;
}

Abelian Period

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 262144/131072 K (Java/Others)
Total Submission(s): 479    Accepted Submission(s): 206

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
  
  

 

Source

BestCoder Round #88

 

Recommend

wange2014   |   We have carefully selected several similar problems for you:   5910  5909  5906  5905  5904