# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
302622 | wilwxk | Rectangles (IOI19_rect) | C++17 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
while (st.size()) st.pop();
for (int j = 0; j < m; j++) {
stack<int> st;
st.push(n);
for (int i = n-1; i >= 0; i--) {
while (st.top() != n && input[st.top()][j] < input[i][j]) st.pop();
mx[3][i+1][j+1] = (st.top()-1)+1;
st.push(i);
}
}