Pagini recente » Cod sursa (job #3278226) | Cod sursa (job #339389) | Cod sursa (job #2206122) | Cod sursa (job #2884213) | Cod sursa (job #943701)
Cod sursa(job #943701)
#include <iostream>
#include <fstream>
using namespace std;
int n,b[100001];
long long a[100001],maxi;
int main()
{
ifstream fin("scmax.in");
ofstream fout("scmax.out");
fin>>n;
for(int i=1;i<=n;i++)fin>>a[i];
b[n]=1;
for(int i=n-1;i>=1;i--)
{
for(int j=i+1;j<=n;j++)
{
if(a[i]<a[j]&&b[j]+1>b[i])b[i]=b[j]+1;
if(b[i]==0)b[i]=1;
if(a[j]<a[i])break;
if(b[i]>maxi)maxi=b[i];
}
}
fout<<maxi<<'\n';
for(int i=1;i<=n;i++)
{
if(b[i]==maxi){fout<<a[i]<<" ";maxi--;}
}
fin.close();
fout.close();
}