# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
24775 | Extazy | Palindromes (APIO14_palindrome) | C++14 | 1000 ms | 2020 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.
/*
example test starts
2
abacaba
www
example test ends
*/
#include <bits/stdc++.h>
using namespace std;
const int N = 16;
int n;
char a[N];
int ans;
bool is_palindrome(int l, int r) {
while(l<r) if(a[l++]!=a[r--]) return false;
return true;
}
int count_occ(int l, int r) {
int ans=0,cnt,i,j;
for(i=1;i+r-l<=n;i++) {
cnt=0;
for(j=i;j<=i+r-l;j++) if(a[j]==a[l+j-i]) ++cnt;
if(cnt==r-l+1) ++ans;
}
return ans;
}
int main() {
int tests,current_case;
int i,j;
tests=1;
for(current_case=1;current_case<=tests;current_case++) {
scanf("%s", a+1);
n=strlen(a+1);
ans=0;
for(i=1;i<=n;i++) for(j=i;j<=n;j++) if(is_palindrome(i,j)) {
ans=max(ans,(j-i+1)*count_occ(i,j));
}
printf("%d\n", 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... |