二分模板

#include
using namespace std;

const int N=100010;
int n,m;
int q[N];
int main(){
    scanf("%d%d",&n,&m);
    for(int i=0;i>1;
            if(q[mid]>=x)   r=mid;
            else l=mid+1;
        }
        if(q[l]!=x) cout<<"-1 -1"<>1;
                if(q[mid]<=x)   l=mid;
                else    r=mid-1;
            }
            cout<