Pagini recente » Cod sursa (job #1334908) | Cod sursa (job #79752) | Cod sursa (job #355047) | Cod sursa (job #1328616) | Cod sursa (job #2037081)
#include <fstream>
std::ifstream fin("cautbin.in");
std::ofstream fout("cautbin.out");
int a[100001], N, v, M, x;
int CautareBinara0(int l, int r, int v);
int CautareBinara1(int l, int r, int v);
int CautareBinara2(int l, int r, int v);
int main()
{
fin >> N;
for (int i = 1; i <= N; ++i)
fin >> a[i];
fin >> M;
while (M--)
{
fin >> x >> v;
if (x == 0)
fout << CautareBinara0(1, N, v) << '\n';
if (x == 1)
fout << CautareBinara1(1, N, v) << '\n';
if (x == 2)
fout << CautareBinara2(1, N, v) << '\n';
}
fin.close();
fout.close();
}
int CautareBinara0(int l, int r, int v)
{
int m, pozitie{-1};
while (l <= r)
{
m = (l + r) / 2;
if (a[m] <= v)
l = m + 1;
else
r = m - 1;
if (a[m] == v)
pozitie = m;
}
return pozitie;
}
int CautareBinara1(int l, int r, int v)
{
int m, pozitie{-1};
while (l <= r)
{
m = (l + r) / 2;
if (a[m] <= v)
l = m + 1, pozitie = m;
else
r = m - 1;
}
return pozitie;
}
int CautareBinara2(int l, int r, int v)
{
int m, pozitie{-1};
while (l <= r)
{
m = (l + r) / 2;
if (a[m] >= v)
r = m - 1, pozitie = m;
else
l = m + 1;
}
return pozitie;
}