Caso # | Resultado | Tiempo | Memoria |
---|---|---|---|
#1 |
Correcto
|
0.004 s | 3 KBi |
#2 |
Correcto
|
0.004 s | 1 KBi |
#3 |
Correcto
|
0.005 s | 1 KBi |
#4 |
Correcto
|
0.004 s | 1 KBi |
#5 |
Correcto
|
0.005 s | 2 KBi |
#6 |
Correcto
|
0.005 s | 1 KBi |
#7 |
Correcto
|
0.004 s | 1 KBi |
#8 |
Correcto
|
0.004 s | 2 KBi |
#9 |
Correcto
|
0.004 s | 1 KBi |
#10 |
Correcto
|
0.005 s | 4 KBi |
#11 |
Correcto
|
0.005 s | 4 KBi |
#12 |
Correcto
|
0.006 s | 2 KBi |
#13 |
Correcto
|
0.004 s | 1 KBi |
#14 |
Correcto
|
0.059 s | 2 KBi |
#15 |
Correcto
|
0.056 s | 3 KBi |
#16 |
Correcto
|
0.052 s | 3 KBi |
#17 |
Correcto
|
0.062 s | 3 KBi |
#18 |
Correcto
|
0.062 s | 3 KBi |
#19 |
Correcto
|
0.047 s | 3 KBi |
#20 |
Correcto
|
0.065 s | 3 KBi |
#include<stdio.h> int main(){ int n; scanf(" %d",&n); int nums[n]; for(int i = 0; i < n;++i) scanf(" %d",&nums[i]); int sumRight = 0; for(int i = 0; i < n;++i) sumRight += nums[i]; int last = n; int sumLeft = 0; for(int i = n-1; i > -1;--i){ sumLeft += nums[i]; sumRight -= nums[i]; if(sumLeft < 0 && sumRight > 0) last = i; } if(last == n) puts("Impossible"); else printf("%d\n",last); return 0; }