BOJ 14040 - Hidden Palindrome [C++]

문제

링크

풀이

#include <iostream>
#include <string>
using namespace std;
 
inline bool palindrome(const string &s) {
  for (int i=0; i<s.length()/2; i++) {
    if (s[i] != s[s.length()-i-1]) return false;
  }
  return true;
}
 
void solve(void) {
  string s; cin >> s;
 
  int ans = 0;
  for (int i=0; i<s.length(); i++) for (int j=i; j<s.length(); j++) {
    if (palindrome(s.substr(i, j-i+1))) ans = max(ans, j-i+1);
  }
  cout << ans;
}
 
int main(void) {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
 
  solve();
  return 0;
}