# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
198295 | forelax | popa (BOI18_popa) | C++14 | 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.
#include<bits/stdc++.h>
#include "popa.h"
using namespace std;
int solve(int n,int* Left,int* Right){
stack<int> Stack;
for(int i = 0 ; i < n ; i ++){
Left[i]=-1;
Right[i]=-1;
while(tack.size()&&!query(Stack.top(),Stack.top(),Stack.top(),i)){
Left[i]=Stack.top();
Stack.pop();
}
if(Stack.size()){
Right[Stack.top()]=i;
}
Stack.push(i);
}
while(Stack.size()>1)Stack.pop();
int rez=Stack.top();
Stack.pop();
return rez;
}