Pagini recente » Cod sursa (job #2973660) | Cod sursa (job #2124687) | Cod sursa (job #569237) | Cod sursa (job #75499) | Cod sursa (job #1860598)
#include<fstream>
using namespace std;
ifstream f("scmax.in");
ofstream g("scmax.out");
long long v[100001],l[100001],n,i,k,max1,t;
int main()
{f>>n;
for(i=1;i<=n;i++)
f>>v[i];
l[n]=1;
for(k=n-1;k>=1;k--)
{max1=0;
for(i=k+1;i<=n;i++)
if(v[i]>v[k]&&l[i]>max1)
max1=l[i];
l[k]=max1+1;
}
max1=l[1];
t=1;
for(i=2;i<=n;i++)
if(l[i]>max1)
{
max1=l[i];
t=i;
}
g<<max1<<'\n'<<v[t]<<" ";
for(i=t+1;i<=n;i++)
if(v[i]>v[t]&&l[i]==max1-1)
{
g<<v[i]<<" ";
max1=max1-1;
}
return 0;
}