Pagini recente » Cod sursa (job #480170) | Cod sursa (job #1664299) | Cod sursa (job #2088242) | Cod sursa (job #2129529) | Cod sursa (job #865257)
Cod sursa(job #865257)
#include <iostream>
#include <fstream>
using namespace std;
int a[100000],n,b[100000],o=0,i,j;
int main()
{
ifstream fin("scmax.in");
ofstream fout("scmax.out");
fin>>n;
for(i=1;i<=n;i++)fin>>a[i];
b[n]=1;
for(i=n-1;i>=1;i--)
{
for(j=i;j<=n;j++)if((a[i]<a[j])&&(b[i]<=b[j]))b[i]=b[j]+1;
}
//for(i=1;i<=n;i++)cout<<b[i];
//cout<<endl;
for(i=1;i<=n;i++)if(b[i]>o)o=b[i];
fout<<o<<endl;
for(i=1;i<=n;i++)
{
if(b[i]==o){fout<<a[i]<<" ";o--;}
}
fin.close();
fout.close();
return 0;
}