Submission #135019

#TimeUsernameProblemLanguageResultExecution timeMemory
135019ly20Palindromes (APIO14_palindrome)C++17
8 / 100
1073 ms1160 KiB
#include<bits/stdc++.h>
using namespace std;
string s;
bool check(int ini,int fim)
{
	while(ini<fim)
	{
		if(s[ini]!=s[fim])return false;
		ini++;fim--;
	}
	return true; 
}
int count(int ini,int fim)
{
	int rs=0;
	int tam=s.size();
	for(int i=0;i<tam-fim+ini ;i++)
	{
		bool ok=true;
		for(int j=i;j<i+fim-ini+1;j++)
		{
			if(s[j]!=s[j-i+ini])
			{
				ok=false;
				break;
			}
		}
		if(ok)
		{
			rs++;
			//printf("%d %d + 1\n",i,i+fim-ini+1);
		}
	}
	return rs;
}
int main()
{
	cin>>s;
	int tam=s.size();
	int resp=0;
	for(int i=0;i<tam;i++)
	{
		for(int j=i;j<tam;j++)
		{
			if(!check(i,j))continue;
			int cnt=count(i,j);
			resp=max(resp,(j-i+1)*cnt);
			//printf("%d %d %d %d\n",i,j,j-i+1,cnt);
		}
	}
	printf("%d\n",resp);
	return 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...