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 "popa.h"
#include <iostream>
using namespace std;
const int nmax=1005;
int st[nmax];
int u,i;
int solve(int N, int* Left, int* Right)
{
    int root=0;
    u=0;
    for(i=0;i<N;i++)
    {
        Left[i]=Right[i]=-1;
        while(u&&query(st[u],i,i,i))
        {
            Right[st[u]]=Left[i];
            Left[i]=st[u];
            u--;
        }
        if(u) Right[st[u]]=i;
        else root=i;
        st[++u]=i;
    }
    return root;
}
| # | Verdict  | Execution time | Memory | Grader output | 
|---|
| Fetching results... | 
| # | Verdict  | Execution time | Memory | Grader output | 
|---|
| Fetching results... | 
| # | Verdict  | Execution time | Memory | Grader output | 
|---|
| Fetching results... |