# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
92902 |
2019-01-05T13:59:35 Z |
Pajaraja |
popa (BOI18_popa) |
C++17 |
|
0 ms |
0 KB |
#include <bits/stdc++.h>
#include "popa.h"
#define MAXN 1007
using namespace std;
int ls[MAXN],rs[MAXN],dml[MAXN],dmr[MAXN];
int rek(int lt,int rt)
{
if(lt>rt) return -1;
int l;
for(int i=lt;i<=rt;i++) {if(dml[i]<=lt && dmr[i]>=rt) l=i; break;}
ls[l]=rek(lt,l-1);
rs[l]=rek(l+1,rt);
return l;
}
int solve(int N,int* Left,int* Right)
{
stack<int> st; st.push(-1);
for(int i=0;i<N;i++)
{
while(st.size()>1 && !query(st.top(),st.top(),st.top(),i)) {dmr[st.top()]=i-1; st.pop();}
dml[i]=st.top()+1;
st.push(i);
}
while(!st.empty()) {dmr[st.top()]=n-1; st.pop();}
int a=rek(0,N-1);
for(int i=0;i<N;i++) Left[i]=ls[i];
for(int i=0;i<N;i++) Right[i]=rs[i];
return a;
}
Compilation message
popa.cpp: In function 'int solve(int, int*, int*)':
popa.cpp:24:36: error: 'n' was not declared in this scope
while(!st.empty()) {dmr[st.top()]=n-1; st.pop();}
^