Pagini recente » Cod sursa (job #2305879) | Cod sursa (job #2307891) | Statistici Shoden (Shoden) | Cod sursa (job #3222021) | Cod sursa (job #1095787)
#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, max1=1, p1=1;
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;
if(l[i]>max1) {max1=l[i]; p1=i;};}
fout<<max1<<"\n";
while(p1>0){
fout<<v[p1]<<" ";
p1=urm[p1];}
return 0;}