Cod sursa(job #3174417)
Utilizator | Data | 24 noiembrie 2023 19:08:06 | |
---|---|---|---|
Problema | Subsir crescator maximal | Scor | 70 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.63 kb |
#include <fstream>
using namespace std;
ifstream cin("scmax.in");
ofstream cout("scmax.out");
int v[100005],n;
int l[100005];
int main()
{
cin>>n;
for(int i=1;i<=n;i++)cin>>v[i];
for(int i=1;i<=n;i++)l[i]=1;
int pozmax=-1;
for(int i=n-1;i>=1;i--)
{
for(int j=i+1;j<=n;j++)
if(v[j]>v[i] && l[i]<l[j]+1)
l[i]=l[j]+1;
pozmax=max(l[i],pozmax);
}
cout<<pozmax<<'\n';
for(int i=1;i<=n && pozmax!=0;i++)
{
if(l[i]==pozmax)
{
pozmax--;
cout<<v[i]<<" ";
}
}
return 0;
}