This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> op(n), t(n, -1);
vector<bool> active(n);
for (int i = 0; i < n; i++) {
cin >> op[i];
if (op[i] < 0) {
for (int j = i - 1; j >= 0; j--) {
if (max(0, -op[j]) < -op[i] && active[j]) {
t[i] = j;
break;
}
}
}
int j = i;
while (j != -1) {
active[j] = !active[j];
j = t[j];
}
bool found = false;
for (int j = i; j >= 0; j--) {
if (t[j] == -1 && active[j]) {
found = true;
cout << op[j] << "\n";
break;
}
}
if (!found) {
cout << 0 << "\n";
}
}
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |