Pagini recente » Cod sursa (job #747043) | Cod sursa (job #1037526) | Cod sursa (job #1461495) | Cod sursa (job #1559199) | Cod sursa (job #2405984)
#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;
mn=0;
for(j=i+1;j<=n;j++)
{
if(a[j]>=a[i]&&a[j]<mx) {if(s[j]+1<mn||mn==0)mn=s[j];mx=a[j];}
}
s[i]=mn+1;
}
mn=a[1];
mnn=s[1];
for(i=1;i<=n;i++)
{
if(a[i]<mn)
{
mn=a[i];
if(mnn<s[i]) mnn=s[i];
}
}
g<<mnn<<'\n';
return 0;
}