Pagini recente » Cod sursa (job #2613273) | Cod sursa (job #1014885) | Cod sursa (job #2728481) | Cod sursa (job #804155) | Cod sursa (job #1650364)
#include <iostream>
#include <fstream>
#include <cstring>
using namespace std;
ifstream f("scmax.in");
ofstream g("scmax.out");
int lis[100000];
int main()
{
int i,j,x[100000],max=0,n,p,k,min,poz[100000];
f>>n;
for(i=1;i<=n;i++)
f>>x[i];
lis[n]=1;
poz[n]=-1;
max=1; p=n;
for(i=n-1;i>=1;--i)
{
lis[i]=1;
poz[i]=-1;
for(j=i+1;j<=n;++j)
if(x[i]<x[j] && lis[i]<lis[j]+1)
{
lis[i]=lis[j]+1;
poz[i]=j;
if(lis[i]>max) max=lis[i],p=i;
}
}
g<<max<<"\n";
i=p;
while(i!=-1)
{
g<<x[i]<<" ";
i=poz[i];
}
}