Envío 2396

Código

#include<bits/stdc++.h>
using namespace std;
#define optimizar_io ios_base::sync_with_stdio(0); cin.tie(0);
int main() {
    int cases, n, tam, ii=1;
    cin >> cases;
    while(cases--){
        cin >> tam;
        vector<int> numbers;
        while(tam--){
            cin >> n;
            numbers.push_back(n);
        }

        stack<int> aux;
        int answer[numbers.size()];
        for(int i=numbers.size()-1;i>=0;i--){
            while(aux.size()>0 and numbers[i] >= aux.top())
                aux.pop();

            if(aux.size() == 0) answer[i] = -1;
            else answer[i] = aux.top();
            aux.push(numbers[i]);
        }

        cout << "Case #" << (ii++) << ": ";
        for(int i=0;i<numbers.size();i++){
            if(i+1 == numbers.size())
                cout << answer[i] << endl;
            else
                cout << answer[i] << " ";
        }
    }
	return 0;
}