Pagini recente » Cod sursa (job #132907) | Cod sursa (job #1163015) | Cod sursa (job #1241139) | Cod sursa (job #1139801) | Cod sursa (job #2405990)
#include <fstream>
#include <climits>
using namespace std;
ifstream f("subsir2.in");
ofstream g("subsir2.out");
long long s[5005],n,i,j,a[5005],mn,mnn,mx;
int main()
{
f>>n;
for(i=1; i<=n; i++) f>>a[i];
s[n]=1;
for(i=n-1; i>=1; i--)
{
mx=LONG_LONG_MAX;
s[i]=LONG_LONG_MAX;
for(j=i+1; j<=n; j++)
{
if(a[i]<=a[j]&&a[j]<mx)
{
if(s[j]+1<s[i])s[i]=s[j]+1;
mx=a[j];
}
}
if(s[i]==LONG_LONG_MAX) s[i]=1;
}
mn=LONG_LONG_MAX;
mnn=LONG_LONG_MAX;
for(i=1; i<=n; i++)
{
if(a[i]<mn)
{
mn=a[i];
if(s[i]<mnn) mnn=s[i];
}
}
g<<mnn<<'\n';
return 0;
}