Pagini recente » Cod sursa (job #1315140) | Cod sursa (job #358674) | Cod sursa (job #1299073) | Cod sursa (job #2319353) | Cod sursa (job #1332683)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("scmax.in");
ofstream g("scmax.out");
int main()
{
int n,a[100000],pos[100000],b[100000],m=0,prim;
f>>n;
for(int i=0;i<n;i++) f>>a[i];
for(int i=n-1;i>=0;i--)
{
b[i]=1;pos[i]=-1;
for(int j=i+1;j<n;j++)
{
if(b[i]<b[j]+1 && a[i]<a[j])
{
b[i]=b[j]+1;
pos[i]=j;
}
}
if(m<b[i])
{
prim=i;
m=b[i];
}
}
g<<m<<'\n';
for(int i=prim;i>=0;i=pos[i]) g<<a[i]<<' ';
g<<'\n';
return 0;
}