Envío 1131

Código

#include <iostream>
using namespace std;

int main() {

  int c;
  cin >> c;

  for (int k = 1; k <= c; k++) {
    int n;
    cin >> n;
    int values[n];

    for (int i = 0; i < n; i++) {
      cin >> values[i];
    }
    
    int response[n];
    int response_index[n];
    
    response[n-1] = -1;
    response_index[n-1] = n-1;
    
    for (int i = n - 2; i >= 0; i--) {
        if (values[i] >= values[i+1]) {
            bool ok = false;
            
            int temp = response_index[i+1];
            while(!ok) {
                if(response[temp] == -1 && values[i] >= values[temp]) {
                    ok = true;
                    response[i] = -1;
                    response_index[i] = i;
                }
                else {
                    if (values[i] < values[temp]) {
                       ok = true;
                       response[i] = values[temp];
                       response_index[i] = temp;
                    }
                    else {
                        temp = response_index[temp];
                    }
                }
            }
        }
        else
        {
           response[i] = values[i+1];
           response_index[i] = i+1;
        }
     
    }

    cout << "Case #" << k << ": ";
    for (int i = 0; i < n - 1; i++)
    {
      cout << response[i] << " ";
    }

    cout << -1 << endl;
  }

  return 0;
}