完美字符串

#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
char a[10005];
int res[30];
int n;
long long ans=0;
int maxn=-1;
int max(int a,int b)
{
    if(a>b)return a;
    else return b;
}

int main()
{
    scanf("%s",a+1);
    n=strlen(a+1);
    int pos=1;
    int QAQ=26;
    for(int i=1;i<=n;++i)
    {
        if(a[i]>=‘a‘&&a[i]<=‘z‘)res[a[i]-‘a‘]++;
        else res[a[i]-‘A‘]++;
    }

    while(n)
    {
        for(int i=0;i<26;++i)
        {
            if(maxn<=res[i])
            {
                maxn=res[i];
                pos=i;
            }
        }
        n--;
        res[pos]=0;
        ans+=maxn*QAQ;
        QAQ--;
        maxn=-1;
    }
    cout<<ans;
    puts("");
    return 0;
}