# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
47906 | square1001 | Palindromes (APIO14_palindrome) | C++14 | 1083 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 <map>
#include <string>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;
string s; map<string, int> d;
int main() {
cin >> s;
int n = s.size();
for (int i = 0; i < n; i++) {
for (int j = i + 1; j <= n; j++) {
string t = s.substr(i, j - i);
bool ok = true;
for (int k = 0; k < t.size(); k++) {
if (t[k] != t[t.size() - k - 1]) ok = false;
}
if (ok) d[t]++;
}
}
int ret = 0;
for (pair<string, int> i : d) {
ret = max(ret, (int)i.first.size() * i.second);
}
cout << ret << '\n';
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... |