Cod sursa(job #3288621)
| Utilizator | Data | 23 martie 2025 12:27:42 | |
|---|---|---|---|
| Problema | Subsir crescator maximal | Scor | 20 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.75 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin ("scmax.in");
ofstream fout ("scmax.out");
int n,v[100005],d[100005],i,j,pre[100005],lmax,pmax;
void afis (int i)
{
//cout<<v[i]<<" ";
if (pre[i]>0) afis (pre[i]);
fout<<v[i]<<" ";
}
int main()
{
fin>>n;
for (i=1;i<=n;i++) fin>>v[i];
for (i=2;i<=n;i++)
{
for (j=i-1;j>0;j--)
if (v[i]>v[j])
{
d[i]=d[j]+1;
break;
}
pre[i]=j;
if (d[i]>=lmax)
{
lmax=d[i];
pmax=i;
}
}
fout<<lmax+1<<'\n';
afis (pmax);
return 0;
}
