Pagini recente » Cod sursa (job #2928255) | Cod sursa (job #3237629) | Cod sursa (job #1111131) | Cod sursa (job #900456) | Cod sursa (job #2669578)
#include <fstream>
using namespace std;
ifstream f("subsir2.in");
ofstream g("subsir2.out");
int a[5005],i,j,mx,n,p,d[5005],fr[5005],mn=5005;
int main()
{
f>>n;
for(i=1; i<=n; i++) f>>a[i];
for(i=1; i<=n; i++)
{
mx=-1000005;
p=0;
for(j=i-1; j>=1; j--)
{
if(a[j]<a[i])
{
fr[j]++;
if(a[j]>mx)
{
mx=a[j];
p=j;
}
}
}
d[i]=d[p]+1;
}
for(i=1; i<=n; i++)
if(fr[i]==0)
{
if(d[i]<mn) mn=d[i];
}
g<<mn<<'\n';
return 0;
}