Submission #718851

#TimeUsernameProblemLanguageResultExecution timeMemory
718851irmuunPalindromes (APIO14_palindrome)C++17
23 / 100
1068 ms131072 KiB
#include<bits/stdc++.h>

using namespace std;

#define pb push_back
#define ll long long
#define ff first
#define ss second
#define all(s) s.begin(),s.end()

int main(){
    ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
    string s;
    cin>>s;
    ll n=s.size();
    ll ans=0;
    map<string,ll>m;
    bool ok;
    for(ll i=0;i<n;i++){
        string t="";
        ll cur=0;
        for(ll j=i;j<n;j++){
            t+=s[j];
            cur++;
            ok=true;
            for(ll k=0;k<cur;k++){
                if(t[k]!=t[cur-k-1]){
                    ok=false;
                    break;
                }
            }
            if(ok==true){
                m[t]++;
            }
        }
    }
    for(auto [t,x]:m){
        ans=max(ans,(ll)t.size()*(ll)x);
    }
    cout<<ans;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...