Envío 26

Código

#include <iostream>
#include <list>
#include <queue>

using namespace std;

void solveCase() {
  int n;
  cin >> n;
  vector<int> a(n);
  for (int i = 0; i < n; ++i) {
    cin >> a[i];
  }

  queue<int> q;
  vector<int> answer(n);
  for (int i = n - 1; i >= 0; --i) {
    while (q.size() > 0 and a[i] >= q.front()) {
      q.pop();
    }
    answer[i] = q.size() == 0 ? -1 : q.front();
    q.push(a[i]);
  }
  for (int i = 0; i < n; ++i) {
    cout << " " << answer[i];
  }

  cout << endl;
}

int main() {
  int N;
  cin >> N;
  for (int i = 1; i <= N; ++i) {
    cout << "Case #" << i << ": ";
    solveCase();
  }
}