Pagini recente » Cod sursa (job #2648524) | Cod sursa (job #1474500) | Cod sursa (job #607951) | Cod sursa (job #2234716) | Cod sursa (job #953941)
Cod sursa(job #953941)
#include<fstream>
using namespace std;
ifstream f("scmax.in");
ofstream g("scmax.out");
int n,a[100010],x[100010],i,t[100010],u,j,p,k,m,s;
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]=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;
}