Envío 861
Problema 0x25 - Suma de un subarreglo grande
- Autor: oigres
- Fecha: 2020-09-26 05:11:24 UTC (Hace más de 3 años)
| Caso # | Resultado | Tiempo | Memoria |
|---|---|---|---|
| #1 |
Incorrecto
|
0.022 s | 3 KBi |
| #2 |
Incorrecto
|
0.023 s | 3 KBi |
| #3 |
Correcto
|
0.022 s | 3 KBi |
| #4 |
Correcto
|
0.027 s | 4 KBi |
| #5 |
Incorrecto
|
0.022 s | 3 KBi |
| #6 |
Incorrecto
|
0.032 s | 3 KBi |
| #7 |
Incorrecto
|
0.024 s | 3 KBi |
| #8 |
Incorrecto
|
0.095 s | 4 KBi |
| #9 |
Incorrecto
|
0.391 s | 8 KBi |
| #10 |
Incorrecto
|
0.409 s | 9 KBi |
| #11 |
Incorrecto
|
0.401 s | 9 KBi |
| #12 |
Incorrecto
|
0.388 s | 9 KBi |
| #13 |
Incorrecto
|
0.395 s | 9 KBi |
| #14 |
Incorrecto
|
0.421 s | 9 KBi |
Puntos totales: 15 / 100
Código
n = int(input())
arr = [int(x) for x in input().split()]
sums = [arr[0]]
for i in range(1, n):
sums.append(arr[i]+sums[i-1])
c = int(input())
for i in range(0,c):
pq = [int(x) for x in input().split()]
p = pq[0]
q = pq[1]
print(sums[q]-sums[p])