Envío 2542

Código

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

using namespace std;

int main(){
    int c;
    cin>>c;
    int p = 1;
    while(c--){
        int n;
        cin>>n;
        vector<int> heights(n,0);
        for(auto &h: heights){
            cin>>h;
        }
        vector<int> sol(n,0);
        sol[n-1] = heights[n-1];
        int currentMax = heights[n-1];
        for(int i=n-1;i>=0;i--){
            if(currentMax==heights[i]){
                sol[i] = -1;
            }
            else if(currentMax<heights[i]){
                currentMax = heights[i];
                sol[i]=-1;
            }
            else{
                sol[i] = currentMax;
            }
        }
        cout<<"Case #"<<p<<": ";
        for(auto &val:sol){
            cout<<val<<" ";
        }
        cout<<endl;
        p++;
    }
    return 0;
}