大意:找到符合条件的最长子序列的长度,该序列包含前k个字母,并且每个字母出现的次数相等
用map水水就过了,维护前k个字母出现次数的最小值,在乘以k就好啦
#include<stdio.h>
#include<string.h>
#include<algorithm>
#include<iostream>
#include<math.h>
#include<queue>
#include<string>
#include<vector>
#include<map>
const int inf = 0x3f3f3f3f;
using namespace std;
const int N = 1e5+9;
const int mod = 1e9+7;
#define ll long long
int n,k;
int vis[29];
int main()
{
//freopen("in.txt","r",stdin);
scanf("%d%d",&n,&k);
string s;
cin>>s;
map<char,int>mp;
for(int i = 0; i<s.size(); i++)
{
mp[s[i]]++;
}
if(mp.size()<k){
cout<<"0"<<endl;
return 0;
}
int minn = inf;
for(int i = 0; i<k; i++)
{
minn = min(minn,mp['A'+i]);
}
cout<<minn*k<<endl;
return 0;
}