Submission #718849

#TimeUsernameProblemLanguageResultExecution timeMemory
718849irmuunPalindromes (APIO14_palindrome)C++17
8 / 100
1080 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;
    for(ll i=0;i<n;i++){
        string t="";
        for(ll j=i;j<n;j++){
            t+=s[j];
            m[t]++;
            string x=t;
            reverse(all(x));
            if(x==t){
                ans=max(ans,m[t]*(j-i+1));
            }
        }
    }
    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...