제출 #556061

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
556061		MurotY	회문 (APIO14_palindrome)	C++14	8 / 100	1089 ms	131072 KiB

palindrome

// author : Murot_06
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#define ios ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define ff first
#define ll long long
#define ss second
using namespace std;
const int N=1e6+7, M=1e9+7;

void solve()
{
	string s;
	cin >> s;
	int n=s.size();
	map <string, ll> mp;
	
	for (int i=0;i<n;i++){
		string a="";
		for (int j=i;j<n;j++){
			a=a+s[j];
			mp[a]++;
		}
	}
	ll ans=0;
	for (int i=0;i<n;i++){
		int pos=i, len=0;
		string a="";
		for (int j=i-1;j>=0;j--){
			if (pos >= n) break;
			if (s[j] == s[pos] && pos < n) len+=2, a=s[j]+a+s[pos], pos++;
			ans=max(ans, len*mp[a]); 
		}
		pos=i+1, len=1;
		a=s[i];
		ans=max(ans, len*mp[a]);
		for (int j=i-1;j>=0;j--){
			if (pos >= n) break;
			if (s[j] == s[pos] && pos < n) len+=2, a=s[j]+a+s[pos], pos++;
			ans=max(ans, len*mp[a]);
		}
		ans=max(ans, len*mp[a]);
	//	if (i == 3) cout << a <<" ";
	}
	cout << ans;
	return ;
}
int main()
{
	ios;
	int t=1;
//	cin >> t;
	while (t--){
	     solve();
	}
	return 0;
}

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