Pagini recente » Cod sursa (job #1027433) | Cod sursa (job #393079) | Cod sursa (job #2957069) | Cod sursa (job #2020792) | Cod sursa (job #716852)
Cod sursa(job #716852)
#include<fstream>
using namespace std;
int a[100000],b[100000],c[100000][2],n,d[100000],l;
void maxim()
{
freopen("scmax.out","w",stdout);
int i,m=0,p;
for(i=0;i<n;i++)
if(b[i]>m)
{
p=i;
m=b[i];
}
printf("%d\n",m);
d[l++]=a[c[p][0]];
for(i=c[p][0]+1;i<=c[p][1];i++)
if(a[i]>d[l-1])
d[l++]=a[i];
for(i=0;i<l;i++)
printf("%d ",d[i]);
printf("\n");
}
int main()
{
int i,j,m;
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;
m=0;
for(j=i-1;j>=0;j--)
if(a[j]<a[i])
if(m<b[j])
{
m=b[j];
b[i]=b[j]+1;
c[i][0]=c[j][0];
}
}
maxim();
return 0;
}