# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
107879 | SamAnd | 회문 (APIO14_palindrome) | C++17 | 1059 ms | 512 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;
const int N = 102;
int n;
char a[N];
int main()
{
cin >> a;
n = strlen(a);
int ans = 0;
for (int l = 0; l < n; ++l)
{
for (int r = l; r < n; ++r)
{
bool z = true;
for (int i = l, j = r; i <= r; ++i, --j)
{
if (a[i] != a[j])
{
z = false;
break;
}
}
if (!z)
continue;
int q = 0;
for (int ll = 0; ll <= n - (l - r + 1); ++ll)
{
int rr = ll + (l - r + 1) - 1;
z = true;
for (int i = l, j = ll; i <= r; ++i, ++j)
{
if (a[i] != a[j])
{
z = false;
break;
}
}
if (z)
++q;
}
ans = max(ans, (r - l + 1) * q);
}
}
cout << ans << 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... |