Submission #412566

#TimeUsernameProblemLanguageResultExecution timeMemory
412566LastRonin회문 (APIO14_palindrome)C++14
8 / 100
1083 ms980 KiB
//#pragma GCC optimize("O3") #include <bits/stdc++.h> #define speed ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0); #define ll long long using namespace std; const ll N = 1e5 + 10; string a; int main() { speed; cin >> a; int n = a.size(); a = '#' + a; ll ans = 0; for(int i = 1; i <= n; i++) { string b; for(int j = i; j <= n; j++) { b += a[j]; bool can = 1; ll m = b.size(); for(int l = 0; l < m; l++) if(b[l] != b[m - l - 1])can = 0; if(!can)continue; ll cnt = 0; for(int l = 1; l <= n - m + 1; l++) { string c = a.substr(l, m); if(c == b) cnt++; } ans = max(ans, cnt * m); } } 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...