Cod sursa(job #3325988)
| Utilizator | Data | 27 noiembrie 2025 09:25:52 | |
|---|---|---|---|
| Problema | Subsir crescator maximal | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.65 kb |
#include <iostream>
using namespace std;
int main()
{
ifstream fin("scmax.in");
ofstream fout("scmax.out");
int a[100],i,n,j,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;j>i;j--)
if(a[i]<a[j]&&lung[i]<lung[j]+1)
{
lung[i]=lung[i]+1;
poz[i]=j;
}
}
fout<<"vectorul poz: :";
for(i=1;i<=n;i++) fout<<poz[i]<<" ";
fout<<endl<<"vectorul lung:";
for(i=1;i<=n;i++)
fout<<lung[i]<<" ";
return 0;
}
