mirror of
https://git.sb/baoshuo/OI-codes.git
synced 2024-11-23 21:08:47 +00:00
789. 数的范围
https://www.acwing.com/problem/content/submission/code_detail/6604256/
This commit is contained in:
parent
1ac51c9103
commit
0f19c2debc
42
AcWing/789/789.cpp
Normal file
42
AcWing/789/789.cpp
Normal file
@ -0,0 +1,42 @@
|
||||
#include <bits/stdc++.h>
|
||||
|
||||
using namespace std;
|
||||
|
||||
int n, q, t, k, a[100005];
|
||||
|
||||
int main() {
|
||||
cin >> n >> q;
|
||||
for (int i = 0; i < n; i++) {
|
||||
cin >> a[i];
|
||||
}
|
||||
for (int i = 0; i < q; i++) {
|
||||
cin >> k;
|
||||
int l = 0;
|
||||
int r = n - 1;
|
||||
while (l < r) {
|
||||
int mid = l + r >> 1;
|
||||
if (a[mid] >= k) {
|
||||
r = mid;
|
||||
} else {
|
||||
l = mid + 1;
|
||||
}
|
||||
}
|
||||
if (a[l] != k) {
|
||||
cout << -1 << ' ' << -1 << endl;
|
||||
continue;
|
||||
}
|
||||
cout << l << ' ';
|
||||
l = 0;
|
||||
r = n - 1;
|
||||
while (l < r) {
|
||||
int mid = l + r + 1 >> 1;
|
||||
if (a[mid] <= k) {
|
||||
l = mid;
|
||||
} else {
|
||||
r = mid - 1;
|
||||
}
|
||||
}
|
||||
cout << l << endl;
|
||||
}
|
||||
return 0;
|
||||
}
|
Loading…
Reference in New Issue
Block a user