Cod sursa(job #3326067)
| Utilizator | Data | 27 noiembrie 2025 12:23:20 | |
|---|---|---|---|
| Problema | Subsir crescator maximal | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.58 kb |
#include <iostream>
using namespace std;
int main()
{
int a[100],i,n,j,lung[100],poz[100];
cin>>n;
for(i=1;i<=n;i++)
cin>>a[i][j];
lung[n]=1; poz[n]=-1;
for(i=n-1;i>=1;i--)
{
lung[i]=1; poz[i]=-1;
for(j=n;j>=1;j--)
if(a[i]<a[j] && lung[i]<lung[j]+1)
{
lung[i]=lung[j]+1;
poz[i]=j;
}
}
cout<<"vectorul poz: ";
for(i=1;i<=n;i++) cout<<poz[i]<<" ";
cout<<endl<<"vectorul lung: ";
for(i=1;i<=n;i++)
cout<<lung[i]<<" ";
return 0;
}
