80 1TLE求条

#include <bits/stdc++.h>
using namespace std;
int high,x[1000010];
bool o=1;
int cha(int w){
    high++;
    int mid,low=1,i=0;
    mid=(high+low)/2;
    if(o) return 1;
    while((x[mid] != w && high > low)||i==0){
        if(x[mid]>w)
            high=mid-1;
        if(x[mid]<w)
            low=mid+1;
        mid=(high+low)/2;
        if(x[mid]==w){
            while(mid>1){
                if(x[mid-1]==w) mid--;
                else break;
            }
        }
        i++;
    }
    if(x[mid]==w) return mid;
    if(high<low) return -1;
}
int main(){
    int n,m;
    cin>>n>>m;
    int w;
    cin>>x[1];
    int p=x[1];
    for(int i=2;i<=n;i++){
        cin>>x[i];
        if(p!=x[i]) o=0;
    }
    for(int i=1;i<=m;i++){
        high=n;
        cin>>w;
        printf("%d ",cha(w));
    } 
    return 0;
}