Cod sursa(job #3358546)
| Utilizator | Data | 17 iunie 2026 17:21:22 | |
|---|---|---|---|
| Problema | Submultimi | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.53 kb |
#include <bits/stdc++.h>
using namespace std;
int p[3][100001];
int v[100001];
int main()
{
int n;
cin >> n;
int j = 0;
for(int i = 1 ; i <= n ; ++i)
{
cin >> v[i];
while(v[i] > p[1][j] && i > 1 && j >= 1)
{
v[p[2][j]]=v[i];
j--;
}
j++;
p[1][j] = v[i];
p[2][j] = i;
}
for(int i = 1 ; i <= j ; ++i)
v[p[2][i]]=-1;
for(int i = 1 ; i <= n ; ++i)
cout << v[i] << ' ';
return 0;
}