【校队排位赛#9 A】 Codeforces 521 DNA Alignment 思维

DNA Alignment
time limit per test2 seconds
memory limit per test256 megabytes
inputstandard input
outputstandard output
Vasya became interested in bioinformatics. He’s going to write an article about similar cyclic DNA sequences, so he invented a new method for determining the similarity of cyclic sequences.

Let’s assume that strings s and t have the same length n, then the function h(s, t) is defined as the number of positions in which the respective symbols of s and t are the same. Function h(s, t) can be used to define the function of Vasya distance ρ(s, t):

where is obtained from string s, by applying left circular shift i times. For example,
ρ(“AGC”, “CGT”) = 
h(“AGC”, “CGT”) + h(“AGC”, “GTC”) + h(“AGC”, “TCG”) + 
h(“GCA”, “CGT”) + h(“GCA”, “GTC”) + h(“GCA”, “TCG”) + 
h(“CAG”, “CGT”) + h(“CAG”, “GTC”) + h(“CAG”, “TCG”) = 
1 + 1 + 0 + 0 + 1 + 1 + 1 + 0 + 1 = 6
Vasya found a string s of length n on the Internet. Now he wants to count how many strings t there are such that the Vasya distance from the string s attains maximum possible value. Formally speaking, t must satisfy the equation: .

Vasya could not try all possible strings to find an answer, so he needs your help. As the answer may be very large, count the number of such strings modulo 109 + 7.

Input
The first line of the input contains a single integer n (1 ≤ n ≤ 105).

The second line of the input contains a single string of length n, consisting of characters “ACGT”.

Output
Print a single number — the answer modulo 109 + 7.

Examples
inputCopy
1
C
outputCopy
1
inputCopy
2
AG
outputCopy
4
inputCopy
3
TTT
outputCopy
1
Note
Please note that if for two distinct strings t1 and t2 values ρ(s, t1) и ρ(s, t2) are maximum among all possible t, then both strings must be taken into account in the answer even if one of them can be obtained by a circular shift of another one.

In the first sample, there is ρ(“C”, “C”) = 1, for the remaining strings t of length 1 the value of ρ(s, t) is 0.

In the second sample, ρ(“AG”, “AG”) = ρ(“AG”, “GA”) = ρ(“AG”, “AA”) = ρ(“AG”, “GG”) = 4.

In the third sample, ρ(“TTT”, “TTT”) = 27

主要思路：

题目可以转换为有多少个串满足和s相同有元素的个数最大
那么就把出现最多的元素个数cnt记下来，然后计算cnt的n次方就好了。
比如ABABC， 就有ABABA, AABAB, AABBB等等

#include <iostream>
#include <vector>
#include <cstdio>
#include <map>
#include <climits>
#include <string>
#include <cmath>
#include <cstring>
#include <stack>
#include <queue>
#include <algorithm>
#define maxn 30000+5
using namespace std;
typedef long long ll;
map<char,ll> mymap;
ll mod  = 1e9 + 7;

ll quick_pow(ll x, ll p)
{
    if(!p)  return 1;
    ll ans = quick_pow(x,p>>1);
    ans =   ans*ans%mod;
    if(p&1)  ans = ans * x%mod;
    return ans;
}

int main()
{
    int n;
    cin>>n;
    string s;
    cin>>s;
    ll maxone=-1;
    for(int i=1;i<=n;i++)
    {
        mymap[s[i-1]]  ++;
        maxone = max(maxone,mymap[s[i-1]]);
    }
    ll cnt = 0;
    for(auto it = mymap.begin();it!=mymap.end();it++)
    {
        if(it->second==maxone)
        cnt++;
    }
    //cout<<
    cout<<quick_pow(cnt,n) <<endl;
    return 0;
}