Cod sursa(job #3326075)
| Utilizator | Data | 27 noiembrie 2025 12:32:57 | |
|---|---|---|---|
| Problema | Subsir crescator maximal | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.62 kb |
#include <iostream>
using namespace std;
int main()
{
int a[100],n,i,j,poz[100],lung[100],scm[100];
cin>>n;
for(int i=1;i<=n;i++)
cin>>a[i];
poz[n]=-1; lung[n]=1;
for(i=n-1;i>=1;i--)
{
poz[i]=-1; lung[i]=1;
for(j=n;j>i;j--)
if(a[i]<a[j]&&lung[i]<lung[j]+1)
{
lung[i]=lung[j]+1;
poz[i]=j;
}
}
int max=INT_MIN,poz2;
for(i=1;i<=n;i++)
if(lung[i]>max) {max=lung[i];
poz2=i;}
cout<<max;
while(poz2!=-1)
{
cout<<a[poz2]<<" ";
poz2=poz[poz2];
}
}
