Caso # | Resultado | Tiempo | Memoria |
---|---|---|---|
#1 |
Correcto
|
0.13 s | 13 KBi |
#2 |
Correcto
|
0.118 s | 13 KBi |
#3 |
Correcto
|
0.114 s | 13 KBi |
#4 |
Correcto
|
0.116 s | 13 KBi |
#5 |
Correcto
|
0.124 s | 13 KBi |
#6 |
Correcto
|
0.113 s | 13 KBi |
#7 |
Correcto
|
0.121 s | 13 KBi |
#8 |
Incorrecto
|
0.138 s | 13 KBi |
#9 |
Incorrecto
|
0.111 s | 13 KBi |
#10 |
Correcto
|
0.109 s | 13 KBi |
#11 |
Incorrecto
|
0.121 s | 13 KBi |
#12 |
Incorrecto
|
0.123 s | 13 KBi |
#13 |
Incorrecto
|
0.118 s | 13 KBi |
#14 |
Correcto
|
0.129 s | 13 KBi |
#15 |
Incorrecto
|
0.112 s | 13 KBi |
#16 |
Incorrecto
|
0.122 s | 13 KBi |
#17 |
Incorrecto
|
0.13 s | 13 KBi |
#18 |
Correcto
|
0.133 s | 13 KBi |
#19 |
Correcto
|
0.14 s | 13 KBi |
import java.util.Scanner; class Main { public static void main(String[] args){ Scanner sc = new Scanner(System.in); int n = sc.nextInt(); int arr[] = new int[n]; int indx = 0; int cont = 1; int area = 0; int mayor = 0; while(sc.hasNextInt() && indx < n){ arr[indx] = sc.nextInt(); indx++; } for(int i = 0; i < arr.length; i++){ for(int j = i + 1; j <= arr.length; j++){ if(j == i){ break; } if(j == arr.length){ j = -1; continue; } if(arr[j]>=arr[i]){ cont++; } } area = arr[i]*cont; if(area > mayor){ mayor = area; } cont = 1; } System.out.print(mayor); } }