Pagini recente » Cod sursa (job #3345130) | Cod sursa (job #2837516) | Cod sursa (job #779108) | Cod sursa (job #500192) | Cod sursa (job #3356068)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("scmax.in");
ofstream fout("scmax.out");
#define N 100000
int lung[N+1], prov[N+1], v[N+1];
int main(){
int n,i,j,max,maxlung=0;
fin >> n;
for(i=1;i<=n;i++){
fin >> v[i];
max=0;
for(j=i-1;j>0;j--)
if(v[j]<v[i]&&lung[j]>lung[max])
max=j;
lung[i]=lung[max]+1;
prov[i]=max;
if(lung[i]>lung[maxlung])
maxlung=i;
}
i=maxlung;
j=1;
while(i>0){
lung[j++]=v[i];
i=prov[i];
}
fout << lung[maxlung] << "\n";
while(--j>0)
fout << lung[j] << " ";
return 0;
}