Pagini recente » Cod sursa (job #861675) | Cod sursa (job #24578) | Cod sursa (job #2564608) | Cod sursa (job #540271) | Cod sursa (job #717050)
Cod sursa(job #717050)
#include<fstream>
using namespace std;
int a[100000],b[100000],c[100000][2],n,d[100000];
int main()
{
int i,j,m=0,p,l=0;
freopen("scmax.in","r",stdin);
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
b[i]=1;
c[i][0]=c[i][1]=i;
for(j=i-1;j>=0;j--)
if(a[j]<a[i])
if(m<=b[j]+1)
{
if(m==b[j]+1 && a[i]>=a[b[j]])
l--;
d[l++]=j;
p=i;
m=b[i]=b[j]+1;
c[i][0]=c[j][0];
break;
}
}
freopen("scmax.out","w",stdout);
printf("%d\n",m);
for(i=0;i<l;i++)
printf("%d ",a[d[i]]);
printf("%d\n",a[c[p][1]]);
return 0;
}