Envío 2539

Código

#include<iostream>
#include<vector>
#include<stack>

using namespace std;

vector<int> getBlockHeights(vector<int> &h){
    stack<pair<int,int>> s;
    vector<int>sol(h.size(),0);
    for(int i=0;i<h.size();i++){
        if(s.size()==0){
            s.push({i,h[i]});
        }
        else{
            if(s.size()>0 && s.top().second>=h[i]){
                s.push({i,h[i]});
            }
            else{
                while(s.size()>0 && s.top().second<=h[i]){
                    auto sTop = s.top();
                    if(sTop.second==h[i]){
                        sol[sTop.first] = -1;
                    }
                    else{
                        sol[sTop.first] = h[i];
                    }
                    s.pop();
                }
                s.push({i,h[i]});
            }
        }
    }
    while(s.size()>0){
        auto sTop = s.top();
        sol[sTop.first] = -1;
        s.pop();
    }
    return sol;
}

int main(){
    int c;
    cin>>c;
    while(c--){
        int n;
        cin>>n;
        vector<int> heights(n,0);
        for(auto &h: heights){
            cin>>h;
        }
        vector<int> sol = getBlockHeights(heights);
        for(int val: sol){
            cout<<val<<" ";
        }
        cout<<endl;
    }
    return 0;
}