Pagini recente » Cod sursa (job #2106085) | Cod sursa (job #2803271) | Cod sursa (job #551156) | Cod sursa (job #1550863) | Cod sursa (job #1146641)
#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;
for(int i=n-1;i>=1;i--)
{
l[i]=1;
j=i;
do {j++;}
while (a[i]>a[j] and j<n);
if(a[i]<a[j])
l[i]=fmax(j)+1;
}
int maxi=-1,maxii;
for(int i=1;i<=n;i++)
if(l[i]>maxi)
{
maxi=l[i];
maxii=i;
}
fout<<maxi<<'\n';
maxi=a[maxii];
fout<<maxi<<" ";
for(int i=maxii+1;i<=n;i++)
if(a[i]>maxi and l[i]==l[maxii]-1)
{
maxi=a[i];
fout<<maxi<<" ";
maxii=i;
}
return 0;
}