Submission #431842

#TimeUsernameProblemLanguageResultExecution timeMemory
431842sikamax2019Palindromes (APIO14_palindrome)C++14
23 / 100
1052 ms131076 KiB
#include <bits/stdc++.h>
using namespace std;
#define IOS ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define sz(x) (int)(x).size()
#define all(x) x.begin(), x.end()
bool ok(string s){
    string t=s;
    reverse(all(t));
    return s==t;
}
void solve() {
    IOS;
    string s;cin>>s;
    map<string,int>mp;
    int n=sz(s);
    int ans=0;
    for(int i=0;i<n;i++){
        for(int j=i;j<n;j++){
            string sub=s.substr(i,j-i+1);
            if(ok(sub)){
                mp[sub]++;
                ans=max(ans,mp[sub]*(j-i+1));
            }
        }
    }
    cout<<ans;
}
int main(){
    solve();
}
#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...