time limit per test
2 seconds
memory limit per test
256 megabytes
input
standard input
output
standard output
You are given a string ss of length nn, which consists only of the first kk letters of the Latin alphabet. All letters in string ss are uppercase.
A subsequence of string ss is a string that can be derived from ss by deleting some of its symbols without changing the order of the remaining symbols. For example, "ADE" and "BD" are subsequences of "ABCDE", but "DEA" is not.
A subsequence of ss called good if the number of occurences of each of the first kk letters of the alphabet is the same.
Find the length of the longest good subsequence of ss.
Input
The first line of the input contains integers nn (1≤n≤1051≤n≤105) and kk (1≤k≤261≤k≤26).
The second line of the input contains the string ss of length nn. String ss only contains uppercase letters from 'A' to the kk-th letter of Latin alphabet.
Output
Print the only integer — the length of the longest good subsequence of string ss.
Examples
input
Copy
9 3 ACAABCCAB
output
Copy
6
input
Copy
9 4 ABCABCABC
output
Copy
0
Note
In the first example, "ACBCAB" ("ACAABCCAB") is one of the subsequences that has the same frequency of 'A', 'B' and 'C'. Subsequence "CAB" also has the same frequency of these letters, but doesn't have the maximum possible length.
In the second example, none of the subsequences can have 'D', hence the answer is 00.
解题说明：此题只需要找出前k个字母中出现次数最少的那个，然后乘以k就是最长的满足题目要求的子串了。
#include<cstdio>
#include<iostream>
#include<string>
#include<cstring>
#include<cmath>
#include<algorithm>
using namespace std;
char a[1000005];
int b[27] = { 0 };
int main()
{
int n, k;
int i,j,min;
scanf("%d%d", &n, &k);
getchar();
for (i = 0; i<n; i++)
{
scanf("%c", &a[i]);
j = a[i] - 65;
b[j]++;
}
min = b[0];
for (i = 1; i<k; i++)
{
if (b[i] < min)
{
min = b[i];
}
}
printf("%d\n", min*k);
return 0;
}