Pagini recente » Cod sursa (job #1116997) | Cod sursa (job #1579560) | Istoria paginii runda/oji20082009/clasament | Cod sursa (job #1204394) | Cod sursa (job #2148363)
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("scmax.in");
ofstream out("scmax.out");
int v[1001],lung[1001],sol[1001];
int main()
{
int n,lmax,maxi=1,cmax = 1;
in>>n;
for(int i=1;i<=n;i++)
in>>v[i];
lung[1]=1;
for(int i=2;i<=n;i++){
lmax=0;
for(int j=1;j<i;j++)
if(v[i]>v[j]){
lmax = max(lmax, lung[j]);
}
lung[i] = 1 + lmax;
cmax = max(cmax, lung[i]);
}
out<<cmax<<"\n";
maxi = cmax;
for(int i=n;i>=1;i--)
if(lung[i]==maxi){
sol[maxi]=i;
maxi--;
}
for(int i=1;i<=cmax;i++)
out<<v[sol[i]]<<" ";
return 0;
}