Pagini recente » Cod sursa (job #1753977) | Cod sursa (job #860146) | Cod sursa (job #333921) | Cod sursa (job #2746646) | Cod sursa (job #1146680)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("scmax.in");
ofstream fout("scmax.out");
int a[100001],l[100001],n;
int fmax(int i)
{
int amax=-1;
for(int k=i;k<=n;k++)
{
if(l[k]>amax)
amax=l[k];
}
return amax;
}
int main()
{
fin>>n;
for(int i=1;i<=n;i++)
fin>>a[i];
l[n]=1;
int j,mx,lm;
for(int i=n-1;i>=1;i--)
{
mx=0;
for(int j=i+1;j<=n;j++)
if(l[j]>mx and a[i]<=a[j])
mx=l[j];
l[i]=mx+1;
if(lm<l[i])
lm=l[i];
}
cout<<lm<<endl;
int t=0,p=1;
do
{
while(l[p]!=lm or a[t]>a[p])
p++;
cout<<a[p]<<" ";
t=p;
lm--;
}
while(lm);
return 0;
}