Pagini recente » Cod sursa (job #2313640) | Cod sursa (job #1856997) | Cod sursa (job #392854) | Cod sursa (job #1447743) | Cod sursa (job #1384468)
#include <iostream>
#include <fstream>
using namespace std;
int v[100001],pred[100001],lung[100001];
ifstream in("scmax.in");
ofstream out("scmax.out");
void subsir (int p)
{
if(pred[p]!=0)
subsir(pred[p]);
out<<v[p]<<" ";
}
int main()
{
int i,j,n,lmax,pr,max=0,p;
in>>n;
for(i=1; i<=n; i++)
in>>v[i];
lung[1] = 1;
pred[1] = 0;
for(i=2; i<=n; i++){
lmax = 0;
pr = 0;
for(j=1; j<i; j++){
if(v[j] < v[i])
if(lung[j] > lmax){
lmax = lung[j];
pr = j;
}
lung[i] = 1+lmax;
pred[i] = pr;
}
}
for(i=1; i<=n; i++)
if(lung[i] > max){
max = lung[i];
p = i;
}
out<<max<<'\n';
subsir(p);
return 0;
}