Caso # | Resultado | Tiempo | Memoria |
---|---|---|---|
#1 |
Correcto
|
0.005 s | 1 KBi |
#2 |
Correcto
|
0.004 s | 1 KBi |
#3 |
Correcto
|
0.004 s | 1 KBi |
#4 |
Correcto
|
0.005 s | 1 KBi |
#5 |
Correcto
|
0.004 s | 1 KBi |
#6 |
Correcto
|
0.005 s | 1 KBi |
#7 |
Correcto
|
0.005 s | 1 KBi |
#8 |
Correcto
|
0.011 s | 2 KBi |
#9 |
Correcto
|
0.034 s | 2 KBi |
#10 |
Correcto
|
0.031 s | 2 KBi |
#11 |
Correcto
|
0.036 s | 2 KBi |
#12 |
Correcto
|
0.03 s | 2 KBi |
#13 |
Correcto
|
0.049 s | 2 KBi |
#14 |
Correcto
|
0.047 s | 2 KBi |
#include <stdio.h> #include <stdlib.h> int main() { int size; scanf("%d", &size); int *array; array = malloc(size * sizeof(int)); for (int i = 0; i < size; i++) { scanf("%d", &array[i]); } int *sumArray, sumNum = 0; sumArray = malloc(size * sizeof(int)); for (int i = 0; i < size; i++) { sumNum += array[i]; sumArray[i] = sumNum; } int sizeQuery; scanf("%d", &sizeQuery); for (int i = 0; i < sizeQuery; i++) { int p, q; scanf("%d %d", &p, &q); if (p == 0) printf("%d\n", sumArray[q]); else printf("%d\n", (sumArray[q] - sumArray[p - 1])); } return 0; }