Cod sursa(job #2775557)
Utilizator | IDorando tomaionut | Data | 16 septembrie 2021 11:32:35 |
---|---|---|---|
Problema | Secv | Scor | 10 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.67 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("secv.in");
ofstream fout("secv.out");
int n,a[5005],b[5005],k,ma;
int main()
{
int i,j,t;
fin >> n;
for (i=1; i<=n; i++)
{
fin >> a[i];
b[i]=a[i];
}
sort (b+1, b+n+1);
k=1;
for (i=2; i<=n; i++)
if (b[i]!=b[k])
b[++k]=b[i];
if (k==1)
{
fout << 1;
return 0;
}
for (i=2; i<=n; i++)
if (a[i]==b[1])
{
t=2;
for (j=i+1; j<=n; j++)
{
if (a[j]==b[t]) t++;
if (t==k+1) ma=max(ma,j-i+1);
}
}
fout << ma;
return 0;
}