Caso # | Resultado | Tiempo | Memoria |
---|---|---|---|
#1 |
Incorrecto
|
0.121 s | 13 KBi |
#2 |
Incorrecto
|
0.112 s | 13 KBi |
#3 |
Incorrecto
|
0.097 s | 13 KBi |
#4 |
Incorrecto
|
0.156 s | 13 KBi |
#5 |
Incorrecto
|
0.081 s | 17 KBi |
#6 |
Incorrecto
|
0.084 s | 16 KBi |
#7 |
Incorrecto
|
0.08 s | 16 KBi |
#8 |
Incorrecto
|
0.159 s | 13 KBi |
#9 |
Incorrecto
|
0.15 s | 13 KBi |
#10 |
Incorrecto
|
0.223 s | 18 KBi |
#11 |
Incorrecto
|
0.64 s | 92 KBi |
#12 |
Incorrecto
|
0.584 s | 85 KBi |
#13 |
Incorrecto
|
0.592 s | 93 KBi |
import java.util.Scanner; class Main { public static void main(String[] args){ Scanner sc = new Scanner(System.in); int n = sc.nextInt(); int a[] = new int[n]; for(int i = 0; i < n; i++){ a[i] = sc.nextInt(); } int c = sc.nextInt(); for(int i = 0; i < c; i++){ int l = sc.nextInt(); int r = sc.nextInt(); resolve(a,l,r); } } public static void resolve(int[] a,int l, int r){ int mayor = Integer.MIN_VALUE; int x = 0; for(int i = l; i <= r; i++){ if(a[i] > mayor){ mayor = a[i]; x = i; } } System.out.print(x); } }