제출 #976199

#제출 시각아이디문제언어결과실행 시간메모리
976199JahonaliXPalindromes (APIO14_palindrome)C++17
0 / 100
1063 ms9432 KiB
#include <bits/stdc++.h>

using namespace std;

#define int long long

signed main() {
    string a;
    cin >> a;
    map<string, int> mp;
    int mx = 0, n = a.size();
    for (int i = 0; i < n; ++i) {
        string b = "";
        b += a[i];
        mp[b]++;
        int l = i, r = i;
        while (l > 0 && r < n - 1) {
            l--, r++;
            b = a[l] + b + a[r];
            mp[b]++;
        }
    }
    for (int i = 0; i < n - 1; ++i) {
        string b = "";
        int l = i + 1, r = i;
        while (l > 0 && r < n - 1) {
            l--, r++;
            b = a[l] + b + a[r];
            mp[b]++;
        }
    }
    for (auto &[x, y] : mp) {
        mx = max(y * (int) x.size(), mx);
    }
    cout << mx;
    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...