题目描述

blablabla

样例

#include <iostream>
using namespace std;
const int N = 1e6+10;
int n, m;
int q[N];

int main(){
    scanf("%d%d", &n, &m);
    for(int i = 0; i < n; ++i) scanf("%d", &q[i]);

    while(m --){
        int x;
        scanf("%d", &x);
        int l = 0, r = n-1;
        while(l < r){
            int mid = l + r+1 >>1;
            if(q[mid] <= x) l=mid;
            else r = mid-1 ;
        }
        if(q[l] != x) cout<<"-1 -1"<<endl;
        else{
            cout<<l<<' ';
            int l= 0, r=n-1;
            while(l<r){
                int mid = l + r >>1;
                if(q[mid] >= x) r=mid;
                else l=mid+1;
            }
            cout<<l<<endl;
        }
    }
    return 0;
}

算法1

(暴力枚举) $O(n^2)$

blablabla

时间复杂度

参考文献

C++ 代码

blablabla

算法2

(暴力枚举) $O(n^2)$

blablabla

时间复杂度

参考文献

C++ 代码

blablabla