Caso # | Resultado | Tiempo | Memoria |
---|---|---|---|
#1 |
Incorrecto
|
0.028 s | 4 KBi |
#2 |
Correcto
|
0.022 s | 3 KBi |
#3 |
Correcto
|
0.022 s | 3 KBi |
#4 |
Correcto
|
0.025 s | 4 KBi |
#5 |
Correcto
|
0.029 s | 3 KBi |
#6 |
Incorrecto
|
0.024 s | 3 KBi |
#7 |
Incorrecto
|
0.021 s | 3 KBi |
#8 |
Incorrecto
|
0.066 s | 5 KBi |
#9 |
Incorrecto
|
0.25 s | 15 KBi |
#10 |
Incorrecto
|
0.264 s | 15 KBi |
#11 |
Incorrecto
|
0.265 s | 15 KBi |
#12 |
Incorrecto
|
0.265 s | 15 KBi |
#13 |
Incorrecto
|
0.317 s | 19 KBi |
#14 |
Incorrecto
|
0.29 s | 16 KBi |
n = int(input()) numbers = list(map(int, input().split())) assert(n == len(numbers)) c = int(input()) queries = [list(map(int, input().split())) for i in range(c)] accumulated_sum = [] sum = 0 for number in numbers: sum += number accumulated_sum.append(sum) def sub_array_sum(p, q): assert(p <= q) assert(q <= len(accumulated_sum)) if p == q: return (accumulated_sum[q]) return(accumulated_sum[q] - accumulated_sum[p - 1]) for query in queries: p, q = query print(sub_array_sum(p, q))