Pagini recente » Cod sursa (job #2902096) | Cod sursa (job #2329747) | Cod sursa (job #852639) | Cod sursa (job #1744455) | Cod sursa (job #1371003)
#include <iostream>
#include<fstream>
using namespace std;
ifstream f("secv.in");
ofstream g("secv.out");
int main()
{
long long int a[5000],n,i,j,b[5000],m=0,fin=0,inceput=0,nr=0;
f>>n;
for(i=1;i<=n;i++)
{f>>a[i];
b[i]=1;
}
for(i=1;i<=n;i++)
for(j=i-1;j>0;j--)
{
if(a[i]>a[j])
b[i]=max(b[i],b[j]+1);
if(b[i]>m)
m=b[i];
}
for(i=1;i<=n;i++)
{
if(b[i]==m)
{
fin=i;
break;
}
}
i=fin;
for(j=fin-1;j>0;j--)
{
if(b[j]==b[i]-1)
{
i=j;
m--;
inceput=i;
}
}
for(i=inceput;i<=fin;i++)
nr++;
if(nr==1)
g<<-1;
else
g<<nr;
return 0;
}