Cod sursa(job #2866385)
| Utilizator | Data | 9 martie 2022 17:43:51 | |
|---|---|---|---|
| Problema | Subsir crescator maximal | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.54 kb |
#include <bits/stdc++.h>
using namespace std;
int n, v[100001], nr[100001], MAX;
int main()
{
cin>>n;
for (int i=1; i<=n; i++)
cin>>v[i];
nr[n]=1;
for (int i=n-1; i>=1; i--)
{
int max=0;
for (int j=i+1; j<=n; j++)
if(nr[j]>max && v[j]>v[i])
max=nr[j];
nr[i]=max+1;
if(nr[i]>MAX)
MAX=nr[i];
}
cout<<MAX<<'\n';
for (int i=1; i<=n; i++)
if(nr[i]==MAX)
cout<<v[i]<<' ', MAX--;
return 0;
}
