| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 64465 | TadijaSebez | popa (BOI18_popa) | C++11 | 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 "popa.h"
#include <stdio.h>
const int N=1050;
int S[N],c;
int Solve(int n, int *l, int *r)
{
int i;
int root;
for(i=0;i<n;i++)
{
while(c && query(S[c],i,i,i))
{
l[i]=S[c];
r[S[c]]=r[i];
c--;
}
if(!c) root=i;
else r[S[c]]=i;
S[++c]=i;
}
return root;
}
