Pagini recente » Cod sursa (job #544690) | Cod sursa (job #99773) | Cod sursa (job #768894) | Cod sursa (job #2044108) | Cod sursa (job #2972352)
#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(cnt==1 && best[1]<v[i])
{
best[++cnt]=v[i];
}
else if(cnt==1 && best[1]>v[i])
best[1]=v[i];
else
{
if(best[cnt]<v[i])
{
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<<'\n';
for(int i=1;i<=cnt;i++)
cout<<best[i]<<" ";
return 0;
}