Pagini recente » Cod sursa (job #2912542) | Cod sursa (job #1451281) | Cod sursa (job #2532153) | Cod sursa (job #2723152) | Cod sursa (job #411586)
Cod sursa(job #411586)
#include <stdio.h>
int n,i,j,a[100001],b[100001];
int main()
{
freopen("scmax.in","r",stdin);
freopen("scmax.out","w",stdout);
scanf("%d",&n);
for(i=1;i<=n;i++)
scanf("%d",&a[i]);
b[n]=1;
for(i=n-1;i>=1;i--)
{
for(j=i;j<=n;j++)
if(a[j]>a[i])
{
b[i]=b[j]+1;
break;
}
if(j==n+1)
b[i]=1;
}
int max=b[1],p;
for(i=1;i<=n;i++)
if(b[i]>max)
{
max=b[i];
p=i;
}
printf("%d\n%d ",max,a[p]);
for(i=p+1;i<=n;i++)
if(a[i]>max)
{
max=a[i];
printf("%d ",max);
}
return 0;
}