Pagini recente » Cod sursa (job #1744463) | Monitorul de evaluare | Cod sursa (job #1369556) | Cod sursa (job #2631702) | Cod sursa (job #858677)
Cod sursa(job #858677)
#include <cstdio>
using namespace std;
int a[100000],lg[100000],n;
int main()
{
freopen("scmax.in","r",stdin);
freopen("scmax.out","w",stdout);
scanf("%d",&n);
for(int i=1;i<=n;i++)
scanf("%d",&a[i]);
lg[n]=1;
for(int i=n;i>=1;i--)
{
int max=0,ok=0;
for(int j=i+1;j<=n;j++)
{
if(lg[j]>max && a[i]<a[j])
{
max=lg[j];
lg[i]=1+max;
ok=1;
}
if(ok==0)
lg[i]=1;
}
}
int max=0,maxi=-1;
for(int i=1;i<=n;i++)
if(lg[i]>max)
{
max=lg[i];
maxi=i;
}
printf("%d\n",max);
printf("%d ",a[maxi]);
int ok=1;
max--;
for(int i=maxi;i<=n-1;i++)
{
for(int j=i+1;j<=n;j++)
{
if(max==lg[j] && a[i]<a[j])
{
printf("%d ",a[j]);
max--;
break;
}
}
}
return 0;
}