Submission #1168482

#TimeUsernameProblemLanguageResultExecution timeMemory
1168482byunjaewoo회문 (APIO14_palindrome)C++20
0 / 100
1 ms328 KiB
#include <bits/stdc++.h> #define int long long using namespace std; signed main() { ios_base::sync_with_stdio(0); cin.tie(0); string s; cin>>s; int n=s.size(); int ans=0; for(int i=0; i<n; i++) for(int j=i; j<n; j++) { bool flag=false; for(int k=i; k<=(i+j)/2; k++) flag|=(s[k]!=s[i+j-k]); if(flag) break; int cnt=0; for(int k=0; k<n-(j-i+1)+1; k++) { bool flag2=true; for(int l=0; l<j-i+1; l++) flag&=(s[i+l]!=s[k+l]); cnt++; } ans=max(ans, cnt*(j-i+1)); } cout<<ans; return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...