Pagini recente » Cod sursa (job #783612) | Cod sursa (job #3198567) | Cod sursa (job #1778643) | Cod sursa (job #2080444) | Cod sursa (job #1092640)
#include<fstream>
using namespace std;
ifstream f("scmax.in");
ofstream g("scmax.out");
int n,m,i,p,j,u,k,l,o,s,a[100001],x[100001],t[100001];
void afis(int k)
{
if(k>0)
{
afis(t[k]);
g<<a[k]<<" ";
}
}
int main()
{
f>>n;
for(i=1;i<=n;i++) f>>a[i];
x[1]=s=1;
for(i=2;i<=n;i++)
{
p=1;
u=s;
while(p<=u)
{m=(p+u)/2;
if(a[i]>a[x[m]]) p=m+1;
else u=m-1;}
if(p>s) s++;
x[p]=i;
t[i]=x[p-1];
}
g<<s<<"\n";
afis(x[s]);
return 0;
}