Envío 1470
Problema 0x25 - Suma de un subarreglo grande
- Autor: Serivt
- Fecha: 2020-10-28 01:19:17 UTC (Hace alrededor de 4 años)
| Caso # | Resultado | Tiempo | Memoria |
|---|---|---|---|
| #1 |
Incorrecto
|
0.019 s | 3 KBi |
| #2 |
Incorrecto
|
0.02 s | 3 KBi |
| #3 |
Incorrecto
|
0.019 s | 3 KBi |
| #4 |
Incorrecto
|
0.019 s | 3 KBi |
| #5 |
Incorrecto
|
0.018 s | 3 KBi |
| #6 |
Incorrecto
|
0.022 s | 3 KBi |
| #7 |
Incorrecto
|
0.021 s | 3 KBi |
| #8 |
Incorrecto
|
0.106 s | 4 KBi |
| #9 |
Incorrecto
|
0.474 s | 9 KBi |
| #10 |
Incorrecto
|
0.46 s | 9 KBi |
| #11 |
Incorrecto
|
0.557 s | 9 KBi |
| #12 |
Incorrecto
|
0.459 s | 9 KBi |
| #13 |
Incorrecto
|
0.456 s | 9 KBi |
| #14 |
Incorrecto
|
0.474 s | 9 KBi |
Puntos totales: 0 / 100
Código
import itertools
n = input()
arr = list(map(int, input().split(" ")))
c = int(input())
acum = list(itertools.accumulate(arr))
print(acum)
for i in range(0, c):
[p, q] = map(int, input().split())
print(acum[q] - (acum[p - 1] if p > 0 else 0))