Submission #731112

#	Time	Username	Problem	Language	Result	Execution time	Memory
731112		Cutebol	Palindromes (APIO14_palindrome)	C++17	8 / 100	1080 ms	131072 KiB

palindrome

#include <bits/stdc++.h>
   
using namespace std;
#define Nilou ios_base::sync_with_stdio(0) ; cin.tie(0) ; cout.tie(0) ;
#define int long long
#define ff first
#define ss second

const int N = 2e5 + 5 ;
const int mod = 1e9 + 7 ;
const int inf = 1e15 ;

int n , k ;
string s ;
map <string , int> mp ;
bool a[1003][1003] ;

void solve(){
	
	cin >> s ;
	n = s.size() ; int ans = 0 ;
	for ( int i = 0 ; i < n ; i ++ ){
		string x , z ;
		for ( int j = i ; j < n ; j ++ ){
			x += s[j] ;
			z = s[j]+z ;
			if ( z == x ) a[i][j] = 1 ;
			mp[x] ++ ;
		}
	}
	for ( int i = 0 ; i < n ; i ++ ){
		string x ;
		for ( int j = i ; j < n ; j ++ ){
			x += s[j] ;
			if ( a[i][j] ) ans = max ( ans , mp[x]*(j-i+1) ) ; 
		}
	}
	cout << ans ;
}

signed main(){
	Nilou ;
	int t = 1 ;
//	cin >> t ;
	while ( t -- ) solve() ;
}

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