Pagini recente » Cod sursa (job #393349) | Cod sursa (job #3162843) | Cod sursa (job #504477) | Rating Benchea Vlad (vlad060297) | Cod sursa (job #2025006)
#include <fstream>
using namespace std;
ifstream fin("scmax.in");
ofstream fout("scmax.out");
int n,a[100005],best[100005],poz[100005],maxi;
void Afis(int k)
{
if(poz[k]!=0)
Afis(poz[k]);
fout<<a[k]<<" ";
}
int main()
{ int i,j;
fin>>n;
for(i=1;i<=n;++i)
fin>>a[i];
best[1]=1; poz[1]=0;
for(i=2;i<=n;++i)
{ best[i]=1; poz[i]=0;
for(j=1;j<=i-1;++j)
if( a[j]<a[i] && best[i]< best[j]+1 )
{ best[i]=best[j]+1;
poz[i]=j;
}
}
maxi=1;
for(i=2;i<=n;++i)
if(best[i]>best[maxi])
maxi=i;
fout<<best[maxi]<<"\n";
Afis(maxi);
return 0;
}