Pagini recente » Cod sursa (job #2483) | Cod sursa (job #1464091) | Cod sursa (job #1755748) | Cod sursa (job #1171587) | Cod sursa (job #1095747)
#include <iostream>
#include <fstream>
using namespace std;
int main(){
ifstream fin("scmax.in"); ofstream fout("scmax.out");
long v[100001], n, l[100001], urm[100001], i, max, p, j;
fin>>n;
for(i=1; i<=n; i++) fin>>v[i];
l[n]=1; urm[n]=0;
for(i=n-1; i>=1; i--){
max=0; p=0;
for(j=i+1; j<=n; j++)
if(v[i]<v[j] && l[j]>max){
max=l[j];
p=j;}
l[i]=max+1; urm[i]=p;}
max=l[1]; p=1;
for(i=2; i<=n; i++)
if(l[i]>max){max=l[i]; p=i;}
fout<<max<<"\n";
while(p>0){
fout<<v[p]<<" ";
p=urm[p];}
fin.close(); fout.close();
return 0;}