제출 #431751

#제출 시각아이디문제언어결과실행 시간메모리
431751sikamax2019회문 (APIO14_palindrome)C++14
0 / 100
732 ms131076 KiB
#include <bits/stdc++.h> using namespace std; int longestPalSubstr(string str) { int n = str.size(); bool table[n][n]; memset(table, 0, sizeof(table)); int maxLength = 1; for (int i = 0; i < n; ++i) table[i][i] = true; int start = 0; for (int i = 0; i < n - 1; ++i) { if (str[i] == str[i + 1]) { table[i][i + 1] = true; start = i; maxLength = 2; } } for (int k = 3; k <= n; ++k) { for (int i = 0; i < n - k + 1; ++i) { int j = i + k - 1; if (table[i + 1][j - 1] && str[i] == str[j]) { table[i][j] = true; if (k > maxLength) { start = i; maxLength = k; } } } } return maxLength; } int main() { string str; cin>>str; cout << longestPalSubstr(str); return 0; }

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

palindrome.cpp: In function 'int longestPalSubstr(std::string)':
palindrome.cpp:16:6: warning: variable 'start' set but not used [-Wunused-but-set-variable]
   16 |  int start = 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...