Submission #60988748

---

Source Code Expand

#include<bits/stdc++.h>
#define ll long long
#define fi(l) freopen(l".in","r",stdin)
#define fo(l) freopen(l".out","w",stdout)
//#pragma G++ optimize(2)
using namespace std;
inline ll read()
{
	ll v=0,f=1;
	char c=getchar();
	while(c<'0'||c>'9')
	{
		if(c=='-')f=-1;
		c=getchar();
	}
	while(c>='0'&&c<='9')
	{
		v=v*10+c-'0';
		c=getchar();
	}
	return v*f;
}
inline void out(ll x)
{
	if(x<0)
	{
		putchar('-');
		x=-x;
	}
	if(x<10)putchar(x+'0');
	else 
	{
		out(x/10);
		putchar(x%10+'0');
	}
}
ll h[3020],hhh[3020];
int main()
{
	//fi("");
	//fo("");
	//ios::sync_with_stdio(0);
	//cin.tie(0);
	//cout.tie(0);
	ll n=read();
	for(ll i=1;i<=n;i++)
	{
		h[i]=read();
		hhh[i]=h[i];
	}
	sort(hhh+1,hhh+n+1);
	bool f=true;
	for(ll i=1;i<n;i++)
	{
		if(hhh[i]==hhh[i+1])
		{
			f=false;
			break;
		}
	}
	if(f||n==1)
	{
		out(1);
		return 0;
	}
	ll ans=0;
	for(ll k=1;k<n;k++)
	{
		for(ll i=1;i<=n-k;i++)
		{
			ll cnt=1;
			for(ll j=i+k;j<=n;j+=k)
			{
				if(h[j]!=h[j-k])break;
				else cnt++;
			}
			ans=max(ans,cnt);
		}
	}
	out(ans);
	return 0;
}

Submission Info

Judge Result