Pagini recente » Cod sursa (job #1288180) | Cod sursa (job #380920) | Cod sursa (job #2455938) | Cod sursa (job #1566877) | Cod sursa (job #1073057)
#include<iostream>
using namespace std;
#include<stdio.h>
FILE *f,*g;
long n,i,j,maxim,l[100003],maximfinal,memorare[100003],m=1,p;
long long a[100003];
int main()
{
f=fopen("subsir2.in","r");
g=fopen("subsir2.out","w");
fscanf(f,"%ld",&n);
for(i=1;i<=n;i++)
fscanf(f,"%lld",&a[i]);
l[n]=1;
for(i=n-1;i>=1;i--)
{
maxim=0;
for(j=i+1;j<=n;j++)
if(a[i]<a[j]&&l[j]>maxim)
{maxim=l[j];
}
l[i]=maxim+1;
if(l[i]>maximfinal)
maximfinal=l[i];
}
fprintf(g,"%ld\n",maximfinal);
for(i=1;i<=n;i++)
{
if(l[i]==maximfinal)
{fprintf(g,"%lld ",a[i]);
maximfinal--;}
}
}