Cod sursa(job #2241477)

Utilizator Ionut228Ionut Calofir Ionut228 Data 16 septembrie 2018 01:30:54
Problema Cautare binara Scor 40
Compilator cpp Status done
Runda Arhiva educationala Marime 1.12 kb
#include <bits/stdc++.h>

using namespace std;

int bs0(int x, vector<int> v) {
  int lt = -1, rt = v.size(), mid;

  while (rt - lt > 1) {
    mid = (lt + rt) / 2;
    if (v[mid] <= x) {
      lt = mid;
    } else {
      rt = mid;
    }
  }

  if (v[lt] == x) {
    return lt + 1;
  }

  return -1;
}

int bs1(int x, vector<int> v) {
  int lt = -1, rt = v.size(), mid;

  while (rt - lt > 1) {
    mid = (lt + rt) / 2;
    if (v[mid] <= x) {
      lt = mid;
    } else {
      rt = mid;
    }
  }

  return lt + 1;
}

int bs2(int x, vector<int> v) {
  int lt = -1, rt = v.size(), mid;

  while (rt - lt > 1) {
    mid = (lt + rt) / 2;
    if (v[mid] < x) {
      lt = mid;
    } else {
      rt = mid;
    }
  }

  return rt + 1;
}

int main() {
  ifstream cin("cautbin.in");
  ofstream cout("cautbin.out");

  int n;
  cin >> n;
  vector<int> v(n);
  for (int i = 0; i < n; i++) {
    cin >> v[i];
  }

  int m, t, x;
  cin >> m;
  while (m--) {
    cin >> t >> x;
    if (t == 0) {
      cout << bs0(x, v) << '\n';
    } else if (t == 1) {
      cout << bs1(x, v) << '\n';
    } else {
      cout << bs2(x, v) << '\n';
    }
  }

  return 0;
}