# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
647071 | Palindromes (APIO14_palindrome) | C++17 | 1085 ms | 131072 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#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;
for (int i = 0;i<s.size();i++){
string t = "";
for (int j = i;j<s.size();j++){
t += s[j];
m[t]++;
}
}
ll ans = 0;
for (auto [a,b]:m) ans = max(ans,b*int(a.size()));
cout << ans;
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |