Pagini recente » Cod sursa (job #884377) | Cod sursa (job #2692111) | Cod sursa (job #2811130) | Cod sursa (job #1921311) | Cod sursa (job #543214)
Cod sursa(job #543214)
#include<cstdio>
#define l 100002
using namespace std;
void citeste();
void rezolva();
void afiseaza();
int Lg[l],urm[l];
int a[l];
int max,maxi,n;
void citeste()
{
freopen("scmax.in","r",stdin);
scanf("%d",&n);
for(int i=1;i<=n;i++) scanf("%d",&a[i]);
fclose(stdin);
}
void afiseaza()
{
freopen("scmax.out","w",stdout);
printf("%d\n", max);
do
{
printf("%d ",a[maxi]);
maxi=urm[maxi];
}while(maxi);
fclose(stdout);
}
void rezolva()
{
for(int i=n;i>=1;i--)
{
urm[i]=Lg[i]=0;
for(int j=i+1;j<=n;j++)
if(a[j]>a[i] && Lg[j]>Lg[i]) urm[i]=j, Lg[i]=Lg[j];
Lg[i]++;
}
max=Lg[1];
for(int i=1;i<=n;i++)
if(Lg[i]>max) max=Lg[i], maxi=i;
}
int main()
{
citeste();
rezolva();
afiseaza();
return 0;
}