# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
198295 | 2020-01-25T12:39:21 Z | forelax | popa (BOI18_popa) | C++14 | 0 ms | 0 KB |
#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; }