Caso # | Resultado | Tiempo | Memoria |
---|---|---|---|
#1 |
Correcto
|
0.001 s | 0 KBi |
#2 |
Correcto
|
0.002 s | 0 KBi |
#3 |
Correcto
|
0.001 s | 0 KBi |
#4 |
Correcto
|
0.001 s | 0 KBi |
#5 |
Correcto
|
0.001 s | 0 KBi |
#6 |
Correcto
|
0.002 s | 0 KBi |
#7 |
Correcto
|
0.001 s | 0 KBi |
#8 |
Correcto
|
0.002 s | 0 KBi |
#9 |
Correcto
|
0.001 s | 0 KBi |
#10 |
Correcto
|
0.004 s | 0 KBi |
#11 |
Correcto
|
0.032 s | 1 KBi |
#12 |
Correcto
|
0.022 s | 1 KBi |
#13 |
Correcto
|
0.022 s | 1 KBi |
#include <iostream> #include <stdio.h> #include <stdlib.h> #include <vector> using namespace std; int main() { int n, c, este, l, r; cin >> n; vector <int> lista; while(n--) { cin >> este; lista.push_back(este); } cin >> c; while(c--) { cin >> l >> r; int mayor, indice; mayor = 0; for(int i = l; i <= r; i++) { if(lista[i] > mayor) { mayor = lista[i]; indice = i; } } cout << indice << endl; } }