Submission #647073

#TimeUsernameProblemLanguageResultExecution timeMemory
647073googlePalindromes (APIO14_palindrome)C++17
8 / 100
1092 ms131072 KiB
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
map<string,ll> m;
int main(){
    cin.tie(0)->sync_with_stdio(0);
    string s; cin >> s;
    int n = int(s.size());
    for (int i = 0;i<n;i++){
        string t = "";
        for (int j = i;j<n;j++){
            t += s[j];
            m[t]++;
        }
    }
    ll ans = 0;
    for (auto [a,b]:m) {
        int sz = a.size()/2, bb = 0;
        for (int i = 0;i<=sz;i++){
            if (a[i] != a[a.size()-i-1]) {
                bb = 1;
                break;
            }
        }
        if (bb) continue;
        ans = max(ans,b*int(a.size()));
    }
    cout << ans;
    return 0;
}
#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...