Caso # | Resultado | Tiempo | Memoria |
---|---|---|---|
#1 |
Correcto
|
0.216 s | 15 KBi |
#2 |
Correcto
|
0.199 s | 17 KBi |
#3 |
Correcto
|
0.211 s | 22 KBi |
#4 |
Correcto
|
0.199 s | 17 KBi |
#5 |
Correcto
|
0.216 s | 16 KBi |
#6 |
Tiempo límite excedido
|
1.034 s | 125 KBi |
#7 |
Tiempo límite excedido
|
0.967 s | 119 KBi |
#8 |
Tiempo límite excedido
|
0.953 s | 67 KBi |
#9 |
Tiempo límite excedido
|
0.919 s | 96 KBi |
#10 |
Tiempo límite excedido
|
0.832 s | 59 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; } } /* * {1, 2, 3} * * */ /*for (int i = 0; i < arrTall.length; i++) { boolean flag = false; arrTall[i] < arrTall[] if (arrTall[i] < ) { } 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(); } } }