Pagini recente » Cod sursa (job #632532) | Cod sursa (job #741972) | Cod sursa (job #747209) | Cod sursa (job #2737795) | Cod sursa (job #336611)
Cod sursa(job #336611)
#include<stdio.h>
#define N 100005
int v[N], best[N], maxim, n, i,max1=0;
int max(int poz)
{int j;
for(j=poz+1;j<=n;j++)
if(v[j]>v[poz])return j;
return 0;
}
void dinamic()
{int k;
for(i=n;i>=1;--i)
{
k=max( i);
if(!k)best[i]=1;
else {best[i]=best[k]+1; if(best[i]>max1){max1=best[i];maxim=i;}}
}
}
void afisare()
{int k=best[maxim];
printf("%d\n",best[maxim]);
for(i=1;i<=n && k;i++)
if(best[i]==k){printf("%d ",v[i]);--k;}
}
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]);
dinamic();
afisare();
return 0;
}