Pagini recente » Cod sursa (job #2180782) | Cod sursa (job #1071069) | Cod sursa (job #887329) | Cod sursa (job #638730) | Cod sursa (job #2972126)
#include <fstream>
using namespace std;
int v[100005],best[100005];
int main()
{
ifstream cin("scmax.in");
ofstream cout("scmax.out");
int n;
cin>>n;
for(int i=1;i<=n;i++)
cin>>v[i];
best[1]=v[1];
int cnt=1;
for(int i=2;i<=n;i++)
{
int st=1,dr=cnt;
if(v[i]>best[cnt])
best[++cnt]=v[i];
else
{
int retin=0;
while(st<=dr)
{
int mij=(st+dr)/2;
if(best[mij]<=v[i])
{
retin=mij;
st=mij+1;
}
else
dr=mij-1;
}
if(retin==0)
best[1]=v[i];
else
best[retin]=v[i];
}
}
cout<<cnt;
return 0;
}