Caso # | Resultado | Tiempo | Memoria |
---|---|---|---|
#1 |
Correcto
|
0.005 s | 1 KBi |
#2 |
Correcto
|
0.006 s | 24 KBi |
#3 |
Correcto
|
0.006 s | 17 KBi |
#4 |
Correcto
|
0.008 s | 12 KBi |
#5 |
Correcto
|
0.004 s | 15 KBi |
#6 |
Correcto
|
0.007 s | 24 KBi |
#7 |
Correcto
|
0.005 s | 11 KBi |
#8 |
Correcto
|
0.005 s | 17 KBi |
#9 |
Correcto
|
0.006 s | 15 KBi |
#10 |
Correcto
|
0.009 s | 13 KBi |
#11 |
Correcto
|
0.042 s | 2 KBi |
#12 |
Correcto
|
0.026 s | 1 KBi |
#13 |
Correcto
|
0.034 s | 1 KBi |
#include <iostream> using namespace std; void findMaximum (int L, int R, int array[]) { // cout << L << " " << R << endl; int max = -1, maxIndex; for (int i = L; i <= R; i++) { if (array[i] > max) { max = array[i]; maxIndex = i; } } cout << maxIndex << endl; } int main() { int N, C; cin >> N; // cout << "N:" << N << endl; int a[N]; for (int i=0; i < N; i++) { cin >> a[i]; // cout << "a["<<i<<"]="<<a[i] << endl; } cin >> C; // cout << "C:" << C << endl; int L, R; for (int i = 0; i < C; i++) { cin >> L >> R; findMaximum(L, R, a); } return 0; }