Pagini recente » Cod sursa (job #2493049) | Cod sursa (job #981933) | Cod sursa (job #2384165) | Cod sursa (job #3206032) | Cod sursa (job #2454479)
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("scmax.in");
ofstream out("scmax.out");
int n,a[100005];
int m,sir[100005];
int bacK[100005];
int sol[100005],q;
int main()
{
in>>n;
for(int i=1;i<=n;i++)
{
in>>a[i];///citire
int x=0;
for(int j=1<<30;j>0;j/=2)
{
if(x+j<=m && a[sir[x+j]]<a[i])
{
x+=j;
}
}
x++;
if(m+1==x)
{
m++;
}
if(m==x)
{
sir[x]=i;
bacK[sir[x]]=sir[x-1];
}
if(a[i]<a[sir[x]])///schimb in sir pozitiile
{
bacK[i]=bacK[sir[x]];
sir[x]=i;
}
}
int t=sir[m];
while(t>0)
{
sol[++q]=a[t];
t=bacK[t];
}
out<<q<<'\n';
for(int i=q;i>0;i--)out<<sol[i]<<' ';
return 0;
}