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