AcWing789:数的范围

AcWing789:数的范围

题目

思路

代码

#include <algorithm>
#include <iostream>
using namespace std;
const int N = 1000010;
int q[N];

int SearchLeft(int left, int right, int x) {
    while (left < right) {
        int mid = left + right >> 1;
        if (q[mid] >= x) right = mid;
        else left = mid + 1;
    }
    return left;
}

int SearchRight(int left, int right, int x) {
    while (left < right) {
        int mid = left + right + 1 >> 1;
        if (q[mid] <= x) left = mid;
        else right = mid - 1;
    }
    return right;
}

int main() {
    int n, m;
    cin >> n;
    cin >> m;
    for (int i = 0; i < n; i++) {
        cin >> q[i];
    }
    while (m--) {
        int x;
        cin >> x;
        int left = SearchLeft(0, n - 1, x);
        if (q[left] != x) cout << "-1 -1" << endl;
        else {
            cout << SearchLeft(0, n - 1, x) << ' ';
            cout << SearchRight(0, n - 1, x) << endl; 
        }
    }
    return 0;
}