Caso # | Resultado | Tiempo | Memoria |
---|---|---|---|
#1 |
Incorrecto
|
0.023 s | 3 KBi |
#2 |
Incorrecto
|
0.021 s | 3 KBi |
#3 |
Correcto
|
0.023 s | 6 KBi |
#4 |
Correcto
|
0.026 s | 3 KBi |
#5 |
Incorrecto
|
0.021 s | 3 KBi |
#6 |
Incorrecto
|
0.02 s | 3 KBi |
#7 |
Incorrecto
|
0.019 s | 3 KBi |
#8 |
Incorrecto
|
0.108 s | 4 KBi |
#9 |
Incorrecto
|
0.461 s | 9 KBi |
#10 |
Incorrecto
|
0.45 s | 9 KBi |
#11 |
Incorrecto
|
0.471 s | 9 KBi |
#12 |
Incorrecto
|
0.474 s | 9 KBi |
#13 |
Incorrecto
|
0.513 s | 9 KBi |
#14 |
Incorrecto
|
0.513 s | 9 KBi |
def construct_prefix_sum(arr): p = [0] for n in arr: p.append(p[-1] + n) return p # ps is prefix sum! def query(ps, l, r): return ps[r] - ps[l - 1] if __name__ == "__main__": N = int(input()) arr = list(map(int, input().split(" "))) p = construct_prefix_sum(arr) q = int(input()) for _ in range(q): l, r = map(int, input().split(" ")) print(query(p, l, r))