# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
33963 | mohammad_kilani | Palindromes (APIO14_palindrome) | C++14 | 409 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;
#define mod 1000000007
#define oo 2000000000
const int N = 100010;
unordered_map <string,int> mp;
char s[N];
int main() {
//freopen("in.txt","r",stdin);
scanf("%s",s);
int n = strlen(s);
long long ans = 0 ;
for(int i=0;i<n;i++){
string s;
for(int j=i;j<n;j++){
s+=i;
int cur = ++mp[s];
if(ans < (long long)cur * (j - i + 1)){
ans = (long long) cur * (j - i + 1);
}
}
}
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... |