Pagini recente » Cod sursa (job #127430) | Cod sursa (job #2584544) | Cod sursa (job #119085) | Cod sursa (job #1298884) | Cod sursa (job #409983)
Cod sursa(job #409983)
#include<cstdio>
#define MAX_N 100000+1
int i,n,k,MAX,MAXS,st,L[MAX_N],a[MAX_N];
void read(),solve();
int main()
{
read();
solve();
return 0;
}
void read()
{
freopen("scmax.in","r",stdin);
freopen("scmax.out","w",stdout);
scanf("%d",&n);
for(i=1;i<=n;i++) scanf("%d",&a[i]);
}
void solve()
{
L[n]=1;
for(k=n-1;k>=1;k--)
{
MAX=0;
for(i=k+1;i<=n;i++)
if(a[i]>a[k] && L[i]>MAX)
MAX=L[i];
L[k]=1+MAX;
if(L[k]>MAXS)
{
MAXS=L[k];
st=k;
}
}
printf("%d\n%d ",MAXS,a[st]);
for(i=st+1;i<=n;i++)
if (a[i]>a[st] && L[i]==MAXS-1)
printf("%d ",a[i]),MAXS--;
}