Cod sursa(job #2418243)

Utilizator roparexRoparex roparex Data 4 mai 2019 14:43:40
Problema Cautare binara Scor 0
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 1.07 kb
#include <iostream>
#include <cmath>
using namespace std;
int st, dr, m, v[100001], n,z,i,x,y;
int divid(int v[100001], int n, int x)
{
	int l , r , m;
	l = 0;
	r = n;
	while (l <= r)
	{
		m = floor((l + r) / 2);
		if (v[m] < x)
			l = m + 1;
		else if (v[m] > x)
			r = m - 1;
		else
			return m;
	}
	return -1;
}
int stanga(int v[100001], int n, int x)
{
	int l, r, m;
	l = 0;
	r = n;
	while(l<r)
	{
		m = floor((l + r) / 2);
		if (v[m] < x)
			l = m + 1;
		else
			r = m;
	}
	return l;
}
int dreapta(int v[100001], int n, int x)
{
	int l, r, m;
	l = 0;
	r = n;
	while (l < r)
	{
		m = floor((l + r) / 2);
		if (v[m] <= x)
			l = m + 1;
		else
			r = m;
	}
	return l-1;
}
int main()
{
	cout << "n=";
	cin >> n;
	for (i = 1; i <= n; i++)
		cin >> v[i];
	cout << "m=";
	cin >> m;
	for (i = 1; i <= m; i++)
	{
		cout << "y=";
		cin >> y;
		cout << "x=";
		cin>>x;
		if (y == 0)
			cout << divid(v, n, x) << endl;
		if(y == 1)
			cout << dreapta(v, n, x) << endl;
		if(y==2)
			cout << stanga(v, n, x) << endl;
	}
	return 0;
}