Pagini recente » Cod sursa (job #2079594) | Cod sursa (job #140983) | Cod sursa (job #1636981) | Borderou de evaluare (job #1644186) | Cod sursa (job #1436624)
#include <fstream>
using namespace std;
ifstream f("scmax.in");
ofstream g("scmax.out");
int n,i,j,l[100001],k;
long v[100001],m;
int main()
{
f>>n;
for(i=1;i<=n;i++)
f>>v[i];
l[n]=1;
for(i=n-1;i>=1;i--)
{
m=0;
for(j=i+1;j<=n;j++)
if(v[i]<v[j]&&l[j]>m)
m=l[j];
l[i]=m+1;
}
m=l[1];
k=1;
for(i=1;i<=n;i++)
if(m<l[i])
{
m=l[i];
k=i;
}
g<<m<<"\n"<<v[k]<<" ";
for(i=k+1;i<=n;i++)
if(l[i]==m-1&&v[i]>v[k])
{
g<<v[i]<<" ";
m=m-1;
}
return 0;
}