Pagini recente » Cod sursa (job #2833417) | Cod sursa (job #1758991) | Cod sursa (job #1753930) | Cod sursa (job #2511987) | Cod sursa (job #1523329)
#include <cstdio>
using namespace std;
int n,a[100000],i,c[100000],k,Max;
bool getmax(int i,int s)
{
int j=i;
int ok=0;
for(;i<=n&&k-s<n-i+1;i++)
if(a[j]<a[i])
{
int p=getmax(i,s+1);
if(p==1)
{
c[++k]=a[j];
ok=1;
}
if(p==0)
ok=-1;
}
if(ok==0)
{
k=1;
c[k]=a[j];
Max=s;
return 1;
}
else
if(ok==1)
return 1;
else
return 0;
}
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]);
k=0;
Max=0;
for(i=1;i<=n&&k<n-i+1;i++)
int p=getmax(i,1);
printf("%d\n",k);
for(i=k;i>0;i--)
printf("%d ",c[i]);
return 0;
}