Pagini recente » Istoria paginii runda/againfminostress/clasament | Cod sursa (job #402556) | Cod sursa (job #1918076) | Cod sursa (job #1815064) | Cod sursa (job #2012197)
#include<fstream>
using namespace std;
ifstream f("subsir2.in");
ofstream g("subsir2.out");
int n;
int v[5001];
int lmax[5001];
int sm[5001];
int main()
{
f>>n;
for(int i=1;i<=n;++i)
f>>v[i];
sm[1]=1;
for(int i=2;i<=n;++i){
for(int j=1;j<i;++j)
if(v[i]>v[j])
sm[i]=max(sm[i],sm[j]+1);
sm[i]=max(sm[i],1);
}
int lmin=sm[n];
for(int i=n-1;i>=1;--i){
bool ok=1;
for(int j=i+1;j<=n;++j)
if(v[j]>=v[i])
{
ok=0;
break;
}
if(ok==1)
lmin=min(lmin,sm[i]);
}
g<<lmin;
return 0;
}