제출 #47239

#제출 시각아이디문제언어결과실행 시간메모리
47239marvenlee회문 (APIO14_palindrome)C++14
8 / 100
1091 ms1432 KiB
#include <iostream> #include <string> using namespace std; int main() { int maxans=0; int subans=0; string s; cin >> s; for(int i=0;i<s.length();i++) { for(int j=s.length()-1;j>=i;j--) { subans=0; int start=i,last=j,state=0; while(start<=last) { if(s[start]!=s[last]) { state=1; break; } start++;last--; } if(state == 0) { string s2= s.substr(i,j-i+1); subans =s2.length(); int finaloccur = s.rfind(s2); int countoccur=1; int found=-1; while(s.find(s2,found+1)!=finaloccur) { countoccur+=1; found =s.find(s2,found+1); } subans*=countoccur; if(subans>maxans)maxans=subans; } } } cout << maxans; return 0; }

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

palindrome.cpp: In function 'int main()':
palindrome.cpp:11:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i=0;i<s.length();i++)
                 ~^~~~~~~~~~~
palindrome.cpp:33:41: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
                 while(s.find(s2,found+1)!=finaloccur)
                       ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
#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...