CS Academy Round #49 C.Max Substring

首先最大的次数一定是单个字母出现的最大次数

记录一下每个字母的出现位置
然后检查以每个字母为首的情况

检查是否能增加串的长度
即对于每个相同字母的后面第j位 检查这些字母是否相同
是的话则可以增长

#include <iostream>
#include <algorithm>
#include <sstream>
#include <string>
#include <queue>
#include <cstdio>
#include <map>
#include <set>
#include <utility>
#include <stack>
#include <cstring>
#include <cmath>
#include <vector>
#include <ctime>
#include <bitset>
using namespace std;
#define pb push_back
#define sd(n) scanf("%d",&n)
#define sdd(n,m) scanf("%d%d",&n,&m)
#define sddd(n,m,k) scanf("%d%d%d",&n,&m,&k)
#define sld(n) scanf("%lld",&n)
#define sldd(n,m) scanf("%lld%lld",&n,&m)
#define slddd(n,m,k) scanf("%lld%lld%lld",&n,&m,&k)
#define sf(n) scanf("%lf",&n)
#define sff(n,m) scanf("%lf%lf",&n,&m)
#define sfff(n,m,k) scanf("%lf%lf%lf",&n,&m,&k)
#define ss(str) scanf("%s",str)
#define ans() printf("%d",ans)
#define ansn() printf("%d\n",ans)
#define anss() printf("%d ",ans)
#define lans() printf("%lld",ans)
#define lanss() printf("%lld ",ans)
#define lansn() printf("%lld\n",ans)
#define fansn() printf("%.10f\n",ans)
#define r0(i,n) for(int i=0;i<(n);++i)
#define r1(i,e) for(int i=1;i<=e;++i)
#define rn(i,e) for(int i=e;i>=1;--i)
#define rsz(i,v) for(int i=0;i<(int)v.size();++i)
#define szz(x) ((int)x.size())
#define mst(abc,bca) memset(abc,bca,sizeof abc)
#define lowbit(a) (a&(-a))
#define all(a) a.begin(),a.end()
#define pii pair<int,int>
#define pli pair<ll,int>
#define mp make_pair
#define lrt rt<<1
#define rrt rt<<1|1
#define X first
#define Y second
#define PI (acos(-1.0))
#define sqr(a) ((a)*(a))
typedef long long ll;
typedef unsigned long long ull;
const ll mod = 1000000000+7;
const double eps=1e-9;
const int inf=0x3f3f3f3f;
const ll infl = 10000000000000000;
const int maxn=  100000+10;
const int maxm = 1000+10;
//Pretests passed
int in(int &ret)
{
    char c;
    int sgn ;
    if(c=getchar(),c==EOF)return -1;
    while(c!='-'&&(c<'0'||c>'9'))c=getchar();
    sgn = (c=='-')?-1:1;
    ret = (c=='-')?0:(c-'0');
    while(c=getchar(),c>='0'&&c<='9')ret = ret*10+(c-'0');
    ret *=sgn;
    return 1;
}

char s[maxn];
vector<int>pos[30];
int main()
{
#ifdef LOCAL
    freopen("input.txt","r",stdin);
//    freopen("output.txt","w",stdout);
#endif // LOCAL

    ss(s+1);
    int n = strlen(s+1);
    int mx = 0;
    for(int i=1;i<=n;++i)
    {
        int idx = s[i]-'a';
        pos[idx].pb(i);
        mx = max(mx,(int)pos[idx].size());
    }
    string ans="";
    r0(i,26)
    {
        int add = 1;
        if(pos[i].size()<mx)continue;
        while(pos[i].back()+add<=n)
        {
            char ch = s[ pos[i][0] + add];
            bool ok = 1;
            int sz = pos[i].size();
            r0(j,sz)
            {
                int p = pos[i][j];
                if(s[p + add] !=ch)
                {
                    ok = 0;
                    break;
                }
            }
            if(!ok)break;
            add++;
        }
        string a = "";
        r0(j,add)a+=s[pos[i][0]+j];
        int alen = a.length();
        int anslen = ans.length();
        if(alen>anslen||a<ans)ans = a;
    }
    cout<<ans;
    return 0;
}