# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
104481 | E869120 | Palindromes (APIO14_palindrome) | C++14 | 1082 ms | 38432 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 <iostream>
#include <string>
#include <map>
#include <algorithm>
using namespace std;
map<long long, long long>Map;
long long maxn = 0; string S;
int main() {
cin >> S;
for (int i = 0; i < S.size(); i++) {
long long r = 0;
for (int j = i; j < S.size(); j++) {
r *= 311; r += (long long)(S[j] - 'a' + 1);
Map[r] += 1LL * (j - i + 1);
maxn = max(maxn, Map[r]);
}
}
cout << maxn << endl;
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... |