Pagini recente » Cod sursa (job #18174) | Cod sursa (job #1659914) | Cod sursa (job #862578) | Cod sursa (job #687618) | Cod sursa (job #1522928)
#include <iostream>
#include <fstream>
using namespace std;
long long v[5001];
int l[5001],p[5001],n,mlx;
int main()
{
ifstream f("secv.in");
ofstream g("secv.out");
f>>n;
for(int i = 1;i<=n;i++)
f>>v[i];
l[1]=1;p[1]=0;mlx = 1;
for(int i = 2;i<=n;i++)
{
for(int j=1;j<i;j++)
if(v[i]==v[j]+1)
if(l[i]<=l[j])
{
l[i]=l[j];
p[i]=j;
}
l[i]++;
if(l[i]>l[mlx]) mlx = i;
}
int d = mlx;
while(p[mlx])
{
mlx = p[mlx];
}
g<<d-mlx+1;
f.close();
g.close();
return 0;
}