# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1138017 | ConquerConquerer | popa (BOI18_popa) | C++20 | 0 ms | 0 KiB |
#include <bits/stdc++.h>
#include "popa.h"
using namespace std;
stack<int> st;
int solve(int N, int* L, int* R) {
st.clear();
int root = -1;
for (int i = 0; i < N; i++)
L[i] = R[i] = -1;
for (int i = 0; i < N; i++) {
while (st.size() && query(st.top(), i, i, i)) {
R[st.top()] = -1;
L[i] = st.top();
st.pop();
}
if (st.empty()) root = i;
else R[st.top()] = i;
st.push(i);
}
return root;
}