Caso # | Resultado | Tiempo | Memoria |
---|---|---|---|
#1 |
Correcto
|
0.005 s | 1 KBi |
#2 |
Correcto
|
0.006 s | 11 KBi |
#3 |
Correcto
|
0.006 s | 1 KBi |
#4 |
Correcto
|
0.006 s | 3 KBi |
#5 |
Correcto
|
0.005 s | 1 KBi |
#6 |
Correcto
|
0.005 s | 4 KBi |
#7 |
Correcto
|
0.007 s | 1 KBi |
#8 |
Correcto
|
0.006 s | 1 KBi |
#9 |
Correcto
|
0.004 s | 1 KBi |
#10 |
Correcto
|
0.006 s | 2 KBi |
#11 |
Correcto
|
0.006 s | 1 KBi |
#12 |
Correcto
|
0.006 s | 2 KBi |
#13 |
Correcto
|
0.006 s | 1 KBi |
#14 |
Correcto
|
0.117 s | 6 KBi |
#15 |
Correcto
|
0.073 s | 3 KBi |
#16 |
Correcto
|
0.087 s | 3 KBi |
#17 |
Correcto
|
0.091 s | 4 KBi |
#18 |
Correcto
|
0.087 s | 3 KBi |
#19 |
Correcto
|
0.089 s | 3 KBi |
#20 |
Tiempo límite excedido
|
1.047 s | 16 KBi |
#include <iostream> #include <vector> #include <list> using namespace std; void splitArray() { int n; cin >> n; vector<int> a(n); list<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_back(i); } } while (q.empty() == false) { int rightIndex = q.back(); q.pop_back(); sum = 0; for (int i = 0; i < rightIndex; ++i) { sum += a[i]; if (sum > 0) { cout << rightIndex << endl; return; } } } cout << "Impossible" << endl; } int main() { splitArray(); }