Pagini recente » Cod sursa (job #1024134) | Cod sursa (job #211827) | Cod sursa (job #380880) | Cod sursa (job #964474) | Cod sursa (job #1096877)
#include<cstdio>
using namespace std;
#define NMAX 100005
#define oo (1<<30)
int N,v[NMAX],best[NMAX],pred[NMAX];
void Read()
{
freopen("scmax.in","r",stdin);
scanf("%d",&N);
for(int i=1;i<=N;i++)
scanf("%d",&v[i]);
}
void Solve()
{
best[1]=1;
v[N+1]=oo;
int i,j,bmax;
for(i=1;i<=N+1;i++)
{
bmax=0;
for(j=1;j<i;j++)
if(v[j]<v[i] && best[j]>best[bmax])
bmax=j;
if(bmax)
{
best[i]=best[bmax]+1;
pred[i]=bmax;
}
else
{
best[i]=1;
pred[i]=0;
}
}
}
void rec(int i)
{
if(best[i])
{
rec(pred[i]);
printf("%d ",v[i]);
}
}
void Print()
{
freopen("scmax.out","w",stdout);
printf("%d\n",best[N+1]-1);
rec(pred[N+1]);
}
int main()
{
Read();
Solve();
Print();
return 0;
}