#include <bits/stdc++.h>
#define D 500
//#include "prize.h"
#define maxN 200002
using namespace std;
int i,x=0;
vector <int> v,a[maxN];
vector <int> u,q;
int find_best(int n){
if(n<=D){
for(i=0;i<min(500,n);i++){
if(a[i].empty()) a[i]=ask(i);
if(a[i][0]+a[i][1]>x) x=a[i][0]+a[i][1];
if(a[i][0]+a[i][1]==0) return i;
}
}
if(n>D){
for(i=0;i<D;i++){
if(a[i*(n/D)].empty()) a[i*(n/D)]=ask(i*(n/D));
if(a[i*(n/D)][0]+a[i*(n/D)][1]>x) x=a[i*(n/D)][0]+a[i*(n/D)][1];
}
for(i=0;i<D;i++){
//if(a[i*(n/D)].empty()) a[i*(n/D)]=ask(i*(n/D));
if(a[i*(n/D)][0]+a[i*(n/D)][1]==x) {u.push_back(a[i*(n/D)][0]); q.push_back(i*(n/D));}
}
}
u.push_back(n);
q.push_back(n);
int p=-1;
for(int i=0;i<x;i++){
int l,d,m,tmp;
tmp=lower_bound(u.begin(),u.end(),v.size()+1)-u.begin();
l=p+1; d=q[tmp];
while(l<d){
m=(l+d)/2;
if(a[m].empty()) a[m]=ask(m);
if(a[m][0]+a[m][1]==x){
if(a[m][0]-v.size()>0) d=m-1;
else l=m+1;
}
else{
d=m;
}
}
if(a[l][0]+a[l][1]==0) return l;
p=l;
}
}
Compilation message
prize.cpp: In function 'int find_best(int)':
prize.cpp:15:27: error: 'ask' was not declared in this scope
if(a[i].empty()) a[i]=ask(i);
^~~
prize.cpp:22:39: error: 'ask' was not declared in this scope
if(a[i*(n/D)].empty()) a[i*(n/D)]=ask(i*(n/D));
^~~
prize.cpp:39:27: error: 'ask' was not declared in this scope
if(a[m].empty()) a[m]=ask(m);
^~~
prize.cpp:51:1: warning: control reaches end of non-void function [-Wreturn-type]
}
^
