Envío 2040
Problema 0xf2 - Partir un arreglo grande en 2
- Autor: S8Vega
- Fecha: 2020-11-20 03:35:33 UTC (Hace alrededor de 4 años)
| Caso # | Resultado | Tiempo | Memoria |
|---|---|---|---|
| #1 |
Correcto
|
0.023 s | 3 KBi |
| #2 |
Correcto
|
0.021 s | 3 KBi |
| #3 |
Correcto
|
0.028 s | 3 KBi |
| #4 |
Correcto
|
0.026 s | 3 KBi |
| #5 |
Correcto
|
0.021 s | 3 KBi |
| #6 |
Correcto
|
0.027 s | 3 KBi |
| #7 |
Correcto
|
0.024 s | 3 KBi |
| #8 |
Correcto
|
0.022 s | 3 KBi |
| #9 |
Correcto
|
0.026 s | 3 KBi |
| #10 |
Correcto
|
0.023 s | 3 KBi |
| #11 |
Correcto
|
0.023 s | 3 KBi |
| #12 |
Correcto
|
0.022 s | 3 KBi |
| #13 |
Correcto
|
0.022 s | 3 KBi |
| #14 |
Correcto
|
0.37 s | 32 KBi |
| #15 |
Correcto
|
0.376 s | 28 KBi |
| #16 |
Correcto
|
0.355 s | 30 KBi |
| #17 |
Correcto
|
0.338 s | 29 KBi |
| #18 |
Correcto
|
0.306 s | 29 KBi |
| #19 |
Correcto
|
0.362 s | 29 KBi |
| #20 |
Correcto
|
0.382 s | 59 KBi |
Puntos totales: 100 / 100
Código
n = int(input())
a = [int(x) for x in input().split()]
ps = [0]
for i in range(len(a)):
ps.append(a[i] + ps[i])
for i in range(1, len(ps)):
if ps[i] > 0 and (ps[len(ps) - 1] - ps[i]) < 0:
print(i)
exit()
print("Impossible")