Envío 483

Código

#include <iostream>
#include <list>
#include <vector>
using namespace std;


vector<int> processLine(int N) {
  vector<int> elements(N);
  for (int i=0; i < N; i++) {
    cin >> elements[i];
  }
  return elements;
}

vector<int> solve(int N, vector<int> elements) {
  vector<int> solution(N);
  list<int> max;
  for (int i = N-1; i >= 0; i--) {
    while (!max.empty() && elements[i] >= max.front()) {
      max.pop_front();
    }
    solution[i] = max.empty() ? -1 : max.front();
    max.push_front(elements[i]);
  }
  return solution;
}

void printCase(int c, int N, vector<int> solution) {
  cout << "Case #" << c << ":";
  for (int i=0; i < N; i++) {
    cout << " " << solution[i];
  }
  cout << endl;
}

int main() {
  int N, C;
  vector<int> elements, solution;
  cin >> C;
  for(int i=1; i<=C; i++) {
    cin >> N;
    elements = processLine(N);
    solution = solve(N, elements);
    printCase(i, N, solution);
  }
}