Envío 1266

Código

#include <stdio.h>
#include <stdlib.h>

int main()
{
  long int cases = 0, size = 0,
  num = 0, mayor = 0, anterior = 0,
  i, j, k;
  long int *array = NULL;
  long int *aux = NULL;
 
  scanf("%li", &cases);
 
  for(i = 0; i < cases; i++)
  {
    scanf("%li", &size);
    array = malloc(sizeof(long int) * size);
    aux = malloc(sizeof(long int) * size);
   
    for(j = 0; j < size; j++)
    {
      scanf("%li", &num);
      array[j] = num;
    }
    
    for(j = size - 1; j >= 0; j--)
    {
      if(array[j] >= mayor)
      {
        mayor = array[j];
        aux[j] = -1;
        anterior = j;
      }
      
      if(array[j] < array[anterior])
      {
        aux[j] = array[anterior];
        anterior = j;
      }
      
      if(array[j] >= array[anterior] && array[j] 
      < mayor)
      {
        while(array[anterior] < mayor && array[j] 
        >= array[anterior])
          anterior++;
        
        aux[j] = array[anterior];
      }
    }
    
    printf("Case #%li:", i + 1);
    for(j = 0; j < size; j++)
      printf(" %li", aux[j]);
    putchar('\n');
    
    mayor = 0;
    free(array);
    free(aux);
  }
}