Caso # | Resultado | Tiempo | Memoria |
---|---|---|---|
#1 |
Correcto
|
0.005 s | 1 KBi |
#2 |
Correcto
|
0.004 s | 1 KBi |
#3 |
Correcto
|
0.004 s | 1 KBi |
#4 |
Correcto
|
0.004 s | 1 KBi |
#5 |
Correcto
|
0.006 s | 1 KBi |
#6 |
Correcto
|
0.005 s | 1 KBi |
#7 |
Correcto
|
0.005 s | 1 KBi |
#8 |
Correcto
|
0.005 s | 1 KBi |
#9 |
Correcto
|
0.005 s | 1 KBi |
#10 |
Correcto
|
0.005 s | 1 KBi |
#11 |
Correcto
|
0.005 s | 1 KBi |
#12 |
Correcto
|
0.004 s | 1 KBi |
#13 |
Correcto
|
0.005 s | 1 KBi |
#14 |
Correcto
|
0.137 s | 11 KBi |
#15 |
Correcto
|
0.082 s | 11 KBi |
#16 |
Correcto
|
0.145 s | 11 KBi |
#17 |
Correcto
|
0.096 s | 11 KBi |
#18 |
Correcto
|
0.111 s | 11 KBi |
#19 |
Correcto
|
0.151 s | 11 KBi |
#20 |
Correcto
|
0.121 s | 11 KBi |
#include <iostream> using namespace std; int main() { int n; cin>>n; long sumsl[n]; long sumsr[n]; int i=0; long sum=0; int nums[n]; for(;i<n;i++ ) { cin >> nums[i]; sum += nums[i]; sumsl[i] =sum; } sum=0; for(i=n-1;i>=0;i-- ) { sum += nums[i]; sumsr[i] =sum; } bool possible; for(i=0;i<n-1;i++ ) { long left = sumsl[i]; long right = sumsr[i+1]; if(left > 0 && right < 0) { possible = true; break; } } if(possible) cout << (i+1); else cout << "Impossible"; return 0; }