Envío 4877

Código

#include <iostream>
#include <stack>
using namespace std;

int main() {
	int t; cin>>t;
	int it = 1;
	while(t--){
		int n; cin>>n;
		int arr[n];
		for(int i=0; i<n;i++) cin>>arr[i];
		stack<int> s;
		int res[n];
		for(int i = n-1; i >=0; i--){
			if(s.empty()) res[i] = -1;
			else{
				while(!s.empty() && arr[i] >= s.top()){
					s.pop();
				}
				if(s.empty()) res[i] = -1;
				else res[i] = s.top();
			}
			s.push(arr[i]);
		}
		cout<<"Case #"<<it<<": ";
		for(auto x: res) cout<<x<<" ";
		cout<<endl;
		it++;
	}
	return 0;
}