제출 #104482

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
104482		E869120	회문 (APIO14_palindrome)	C++14	23 / 100	1079 ms	3108 KiB

palindrome

#include <iostream>
#include <string>
#include <map>
#include <algorithm>
using namespace std;

map<long long, long long>Map;
long long maxn = 0; string S;

bool ispalindrome(string V) {
	for (int i = 0; i < V.size(); i++) {
		if (V[i] != V[V.size() - 1 - i]) return false;
	}
	return true;
}

int main() {
	cin >> S;
	for (int i = 0; i < S.size(); i++) {
		long long r = 0;
		for (int j = i; j < S.size(); j++) {
			r *= 311; r += (long long)(S[j] - 'a' + 1);
			if (ispalindrome(S.substr(i, j - i + 1)) == false) continue;
			Map[r] += 1LL * (j - i + 1);
			maxn = max(maxn, Map[r]);
		}
	}
	cout << maxn << endl;
	return 0;
}

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

palindrome.cpp: In function 'bool ispalindrome(std::__cxx11::string)':
palindrome.cpp:11:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for (int i = 0; i < V.size(); i++) {
                  ~~^~~~~~~~~~
palindrome.cpp: In function 'int main()':
palindrome.cpp:19:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for (int i = 0; i < S.size(); i++) {
                  ~~^~~~~~~~~~
palindrome.cpp:21:21: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for (int j = i; j < S.size(); j++) {
                   ~~^~~~~~~~~~

• Subtask 1: 8 / 8
• Subtask 2: 15 / 15
• Subtask 3: 0 / 24
• Subtask 4: 0 / 26
• Subtask 5: 0 / 27