Pagini recente » Cod sursa (job #2130486) | Cod sursa (job #1075302) | Cod sursa (job #2433754) | Cod sursa (job #190851) | Cod sursa (job #206325)
Cod sursa(job #206325)
#include <stdio.h>
#define FIN "secv.in"
#define FOUT "secv.out"
#define NMAX 4999
#define MAXN 10000
#define MINIM 0x3f3f3f3f
#define INF 666666
int N;
int v[NMAX];
int v1[NMAX];
int v2[NMAX];
int REZ;
int i,j,mij;
int frecv[NMAX];
int nr;
void swap(int a, int b)
{
int aux=a;
a=b;
b=aux;
}
void quicksort(int li, int ls)
{
i=li;
j=ls;
mij=v[(li+ls)/2];
do
{
while (v[j]>mij) --j;
while (v[i]<mij) ++i;
if (i<=j)
{
swap(v[i],v[j]);
++i;
--j;
}
}
while (i<=j);
if (li<j) quicksort(li,j);
if (i<ls) quicksort(i,ls);
}
void read_data()
{
freopen(FIN,"rt",stdin);
scanf("%d", &N);
for (i=0;i<N;++i)
{
scanf("%d", &v[i]);
v1[i]=v[i];
}
}
void write_data()
{
freopen(FOUT,"wt",stdout);
printf("%d",REZ-1);
}
void write_minus()
{
freopen(FOUT,"wt",stdout);
printf("-1");
}
void solve()
{
nr=1;
frecv[v[0]]=1;
for (i=1;i<N;++i)
if (v[i]!=v[i-1])
{
nr++;
frecv[v[i]]=nr;
}
REZ=0;
for (i=0;i<N;++i)
v2[i]=MINIM;
for (i=0;i<=N;++i)
{
if (frecv[v1[i]]==1)
v2[i]=1;
else
frecv[v1[i]]=frecv[v1[i]]-1;
if (i-v2[nr]>REZ)
REZ=i-v2[i];
}
if (REZ!=INF)
write_data();
else
write_minus();
}
int main()
{
read_data();
solve();
printf("\n");
return 0;
}