Caso # | Resultado | Tiempo | Memoria |
---|---|---|---|
#1 |
Incorrecto
|
0.223 s | 15 KBi |
#2 |
Incorrecto
|
0.266 s | 19 KBi |
#3 |
Incorrecto
|
0.208 s | 15 KBi |
#4 |
Incorrecto
|
0.233 s | 15 KBi |
#5 |
Incorrecto
|
0.222 s | 14 KBi |
#6 |
Tiempo límite excedido
|
1.043 s | 108 KBi |
#7 |
Tiempo límite excedido
|
0.948 s | 81 KBi |
#8 |
Tiempo límite excedido
|
1.097 s | 101 KBi |
#9 |
Tiempo límite excedido
|
0.697 s | 61 KBi |
#10 |
Tiempo límite excedido
|
1.064 s | 117 KBi |
import java.util.Scanner; public class Main { public static void main(String[] args) { Scanner scanner = new Scanner(System.in); int numberCase = scanner.nextInt(); for(int n = 0; n < numberCase; n++){ int building = scanner.nextInt(); int[] arrTall = new int[building]; String arrCovered = ""; for(int i = 0; i < arrTall.length; i++){ arrTall[i] = scanner.nextInt(); } for (int i = 0; i < arrTall.length; i++) { boolean flag = false; for(int j = i+1; j < arrTall.length; j++){ if(arrTall[i] < arrTall[j]){ flag = true; arrCovered = arrCovered + " " + arrTall[j]; break; } } if(flag == false){ arrCovered = arrCovered + " " + -1; } } System.out.print("Case #"+(n+1) + arrCovered); System.out.println(); } } }