# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
134940 | degelo | Palindromes (APIO14_palindrome) | C++17 | 189 ms | 5900 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>
#define maxn 1003
bool marc[maxn][maxn];
using namespace std;
map< string ,int > qtd;
map< string,int >::iterator mit;
int main(){
string s;
cin>>s;
int n=s.size();
vector<string> subst;
for(int i=0;i<n;i++){
string last="";
last+=s[i];
for(int i=0;i<subst.size();i++) subst[i]+=last;
subst.push_back(last);
for(int j=0;j<=i;j++){
if(s[j]==s[i]){
if(i==j||i==j+1){
qtd[subst[j]]++;
marc[i][j]=true;
}
else if(marc[i-1][j+1]){
qtd[subst[j]]++;
marc[i][j]=true;
}
}
}
}
int resp=0;
for(mit=qtd.begin();mit!=qtd.end();mit++){
string st=(*mit).first;
int q=qtd[st];
int nt=st.size();
resp=max(resp,q*nt);
}
cout<<resp;
}
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... |