Cod sursa(job #3326015)
| Utilizator | Data | 27 noiembrie 2025 09:38:03 | |
|---|---|---|---|
| Problema | Subsir crescator maximal | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.53 kb |
#include <iostream>
#include <limits.h>
using namespace std;
int main()
{
int a[100],n,i,j,poz[100],lung[100];
cin>>n;
for(i=1;i<=n;i++)
cin>>a[i];
poz[n]=-1;lung[n]=1;
for(i=n-1;i>=1;i--)
{
lung[i]=1;poz[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 maxim=INT_MIN;
for(i=1;i<=n;i++)
if(lung[i]>maxim) maxim=lung[i];
cout<<"lung max: "<<maxim;
return 0;
}
