Pagini recente » Cod sursa (job #1418805) | Cod sursa (job #3192983) | Cod sursa (job #1967526) | Cod sursa (job #1876763) | Cod sursa (job #1244374)
#include<fstream>
using namespace std;
int a[100001],lis[100001],next[100001],n,s[100000];
int main()
{
int i,j,maxim,poz;
ifstream f("scmax.in");
f>>n;
for(i=1;i<=n;i++)
f>>a[i];
f.close();
ofstream fout("scmax.out");
lis[n]=1;
next[n]=n+1;
for(i=n-1;i>0;i--)
{
maxim=0;poz=n+1;
for(j=i+1;j<=n;j++)
{
if(a[j]>a[i] && maxim<lis[j])
{
maxim=lis[j];
poz=j;
}
}
lis[i]=1+maxim;
next[i]=poz;
}
maxim=poz=0;
for(i=1;i<=n;i++)
{
if(maxim<lis[i])
{
maxim=lis[i];
poz=i;
}
}
fout<<maxim<<"\n";
while(poz!=n+1)
{
fout<<a[poz]<<" ";
poz=next[poz];
}
fout.close();
return 0;
}