Pagini recente » Cod sursa (job #333968) | Cod sursa (job #553681) | Cod sursa (job #963775) | Cod sursa (job #2492653) | Cod sursa (job #697075)
Cod sursa(job #697075)
#include<fstream>
using namespace std;
int v[5001],l[5001],uz[5001];
int i,j,n,min1,max1,pos;
int main()
{
freopen("subsir2.in","r",stdin);
scanf("%d",&n);
for(i=1;i<=n;++i)
scanf("%d",&v[i]);
l[n]=1;
for(i=n-1;i>0;--i)
{
l[i]=1;
for(j=i+1;j<=n;j++)
{
if(v[i]<=v[j]&&l[i]<l[j]+1)
l[i]=l[j]+1;
}
if(max1<l[i])
max1=l[i];
}
freopen("subsir2.out","w",stdout);
printf("%d\n",max1);
return 0;
}