제출 #113318

#제출 시각아이디문제언어결과실행 시간메모리
113318Runtime_error_회문 (APIO14_palindrome)C++14
8 / 100
299 ms131072 KiB
#include <bits/stdc++.h> using namespace std; const int inf=1e3+9; int n,ans; string s; bool pal[inf][inf]; map<string,int> mp; int main(){ cin>>s; n=s.size(); s=" "+s; for(int i=1;i<=n;i++) pal[i][i]=1,pal[i][i+1]=(i<n && s[i]==s[i+1]); for(int len=3;len<=n;len++) for(int i=1;i<=n-len+1;i++) pal[i][i+len-1]=(pal[i+1][i+len-2]& s[i]==s[i+len-1]); for(int i=1;i<=n;i++){ string temp=""; for(int j=i;j<=n;j++) temp+=s[j],mp[temp]++; } for(int i=1;i<=n;i++){ string temp=""; for(int j=i;j<=n;j++){ temp+=s[j]; if(pal[i][j]) ans=max(ans,mp[temp]*(j-i+1)); } } cout<<ans<<endl; }

컴파일 시 표준 에러 (stderr) 메시지

palindrome.cpp: In function 'int main()':
palindrome.cpp:21:53: warning: suggest parentheses around comparison in operand of '&' [-Wparentheses]
             pal[i][i+len-1]=(pal[i+1][i+len-2]& s[i]==s[i+len-1]);
#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...