Caso # | Resultado | Tiempo | Memoria |
---|---|---|---|
#1 |
Incorrecto
|
0.005 s | 1 KBi |
#2 |
Incorrecto
|
0.006 s | 1 KBi |
#3 |
Incorrecto
|
0.006 s | 4 KBi |
#4 |
Correcto
|
0.005 s | 1 KBi |
#5 |
Incorrecto
|
0.006 s | 1 KBi |
#6 |
Correcto
|
0.005 s | 1 KBi |
#7 |
Correcto
|
0.007 s | 1 KBi |
#8 |
Correcto
|
0.005 s | 2 KBi |
#9 |
Correcto
|
0.005 s | 2 KBi |
#10 |
Incorrecto
|
0.005 s | 2 KBi |
#11 |
Incorrecto
|
0.006 s | 1 KBi |
#12 |
Incorrecto
|
0.006 s | 11 KBi |
#13 |
Incorrecto
|
0.007 s | 1 KBi |
#14 |
Incorrecto
|
0.097 s | 3 KBi |
#15 |
Incorrecto
|
0.092 s | 4 KBi |
#16 |
Correcto
|
0.096 s | 3 KBi |
#17 |
Incorrecto
|
0.089 s | 3 KBi |
#18 |
Incorrecto
|
0.089 s | 3 KBi |
#19 |
Incorrecto
|
0.087 s | 3 KBi |
#20 |
Incorrecto
|
0.139 s | 4 KBi |
#include <iostream> #include <list> #include <queue> using namespace std; void splitArray() { int n; cin >> n; vector<int> a(n); queue<int> q; for (int i = 0; i < n; ++i) { cin >> a[i]; } long sum = 0; for (int i = n - 1; i > 0; --i) { sum += a[i]; if (sum < 0) { q.push(i); } } while (q.empty() != false) { int rightIndex = q.front(); q.pop(); sum = 0; for (int i = 0; i < rightIndex; ++i) { sum += a[i]; if (sum > 0) { cout << rightIndex; return; } } } cout << "Impossible"; } int main() { splitArray(); }