Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- const int N = 100010;
- int arr[N];
- int n;
- int leftBinarySearch(int x) {
- int l = -1, r = n;
- while (r - l > 1) {
- int m = (l + r) / 2;
- if (arr[m] < x) {
- l = m;
- } else {
- r = m;
- }
- }
- return r;
- }
- int rightBinarySearch(int x) {
- int l = -1, r = n;
- while (r - l > 1) {
- int m = (l + r) / 2;
- if (arr[m] <= x) {
- l = m;
- } else {
- r = m;
- }
- }
- return l;
- }
Advertisement
Add Comment
Please, Sign In to add comment