Pagini recente » Cod sursa (job #1511807) | Cod sursa (job #580528) | Cod sursa (job #3173430) | Cod sursa (job #1698955) | Cod sursa (job #2765873)
#include <fstream>
using namespace std;
ifstream f("scmax.in");
ofstream g("scmax.out");
int a[100007],x[100007],t[100007],n,i,j,s,p,u,m;
void afis(int m)
{if (m)
{afis(t[m]);
g<<a[m]<<" ";
}
}
int main()
{
f>>n;
for(i=1;i<=n;i++)
f>>a[i];
x[1]=1;
p=1;
s=1;
for(i=2;i<=n;i++)
{
p=1;
u=s;
while(p<=u)
{m=(u+p)/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;
}