Pagini recente » Cod sursa (job #2575243) | Cod sursa (job #2797507) | Cod sursa (job #2546115) | Cod sursa (job #610121) | Cod sursa (job #2310689)
#include <bits/stdc++.h>
using namespace std;
int v[5005];
int l[5005];
int dp[5005];
int main()
{
freopen("subsir2.in","r",stdin);
freopen("subsir2.out","w",stdout);
int n,i,j,k,st,dr;
scanf("%d",&n);
for(i=n;i>=1;i--)scanf("%d",&v[i]);
int cnt=0;
int m1=0;
l[1]=v[1];
dp[1]=1;
cnt=1;
m1=1;
for(i=2;i<=n;i++)
{
if(v[i]<=l[cnt])
{
dp[i]=++cnt;
l[cnt]=v[i];
if(cnt>m1)m1=cnt;
continue;
}
int st=1,dr=cnt;
while(st<=dr)
{
int med=(st+dr)/2;
if(v[i]<l[med])st=med+1;
else
dr=med-1;
}
if(dr==0)dr=1;
dp[i]=dr;
l[dr]=v[i];
}
printf("%d\n",m1);
return 0;
}