Caso # | Resultado | Tiempo | Memoria |
---|---|---|---|
#1 |
Incorrecto
|
0.005 s | 1 KBi |
#2 |
Incorrecto
|
0.005 s | 1 KBi |
#3 |
Incorrecto
|
0.005 s | 1 KBi |
#4 |
Incorrecto
|
0.005 s | 1 KBi |
#5 |
Incorrecto
|
0.005 s | 1 KBi |
#6 |
Correcto
|
0.005 s | 1 KBi |
#7 |
Correcto
|
0.005 s | 1 KBi |
#8 |
Correcto
|
0.006 s | 1 KBi |
#9 |
Correcto
|
0.005 s | 1 KBi |
#10 |
Incorrecto
|
0.006 s | 1 KBi |
#11 |
Incorrecto
|
0.005 s | 1 KBi |
#12 |
Incorrecto
|
0.008 s | 1 KBi |
#13 |
Incorrecto
|
0.006 s | 1 KBi |
#14 |
Incorrecto
|
0.229 s | 10 KBi |
#15 |
Incorrecto
|
0.084 s | 12 KBi |
#16 |
Correcto
|
0.099 s | 7 KBi |
#17 |
Incorrecto
|
0.099 s | 7 KBi |
#18 |
Incorrecto
|
0.098 s | 7 KBi |
#19 |
Incorrecto
|
0.099 s | 7 KBi |
#20 |
Incorrecto
|
0.665 s | 21 KBi |
#include <iostream> #include <vector> #include <list> using namespace std; void splitArray() { int n; cin >> n; vector<int> a(n); vector<long> a_sum(n); list<int> q; int prev = 0; for (int i = 0; i < n; ++i) { cin >> a[i]; a_sum[i] = a[i] + prev; prev = 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(); if (a_sum[rightIndex - 1] > 0) { cout << rightIndex << endl; } } cout << "Impossible" << endl; } int main() { splitArray(); }