Pagini recente » Cod sursa (job #2534041) | Cod sursa (job #1757580) | Cod sursa (job #1907131) | Cod sursa (job #2926851) | Cod sursa (job #1436623)
#include <cstdio>
using namespace std;
int j,i,n,v[100005],l[100005],poz,k,Max;
int main()
{
freopen("scmax.in","r",stdin);
freopen("scmax.out","w",stdout);
scanf("%d",&n);
for(i=1;i<=n;i++)
scanf("%d",&v[i]);
l[n]=1;
for(i=n-1;i>=1;i--)
{
Max=0;
for(j=i+1;j<=n;j++)
if((v[i]<v[j]) && (l[j]>Max))
Max=l[j];
l[i]=Max+1;
}
Max=l[1];
k=1;
for(i=1;i<=n;i++)
if(Max<l[i])
{
Max=l[i];
k=i;
}
printf("%d\n",Max);
printf("%d ",v[k]);
for(i=k+1;i<=n;i++)
if(l[i]==Max-1 && v[i]>v[k])
{
printf("%d ",v[i]);
Max=Max-1;
}
return 0;
}