Codeforces #723 div2 D

好难

但是我就是要把你给补了

#include 
using namespace std;
const int maxn =  1e5+10;
typedef long long ll;
string ans,s;
int a[maxn],cnt[maxn],save[maxn];
int sum[maxn][5];
void solve()
{
    int p[]={0,1,2,3,4};
    ll curmx = -1;

    cin>>s;
    int n = s.size();
    for(int i= 1;i