Pagini recente » Cod sursa (job #2688567) | Cod sursa (job #871347) | Cod sursa (job #2319728) | Cod sursa (job #1718039) | Cod sursa (job #2081096)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("cautbin.in");
ofstream g("cautbin.out");
int v[100001];
int cautarebinara1 (int p, int u, int valoare)
{
int m;
while (p <= u)
{
m = (p + u) / 2;
if (v[m] <= valoare)
p = m + 1;
else
u = m - 1;
}
m = (p + u) / 2;
if (v[m] > valoare) m --;
if (v[m] == valoare)
return m;
return -1;
}
int cautarebinara2 (int p, int u, int valoare)
{
int m;
while (p < u)
{
m = (p + u) / 2;
if (v[m] <= valoare)
p = m + 1;
else
u = m;
}
m = (p + u) / 2;
if (v[m] > valoare)
-- m;
return m;
}
int cautarebinara3 (int p, int u, int valoare)
{
int m;
while (p < u)
{
m = (p + u) / 2;
if (v[m] < valoare)
p = m + 1;
else
u = m;
}
m = (p + u) / 2;
if (v[m] < valoare)
++ m;
return m;
}
int main ()
{
int i, n, m, tip, val;
f>>n;
for (i = 1; i <= n; i++)
f>>v[i];
f>>m;
while (m--)
{
f>>tip>>val;
switch(tip)
{
case 0:
{
g<<cautarebinara1(1,n,val)<<"\n";
break;
}
case 1:
{
g<<cautarebinara2(1,n,val)<<"\n";
break;
}
case 2:
{
g<<cautarebinara3(1,n,val)<<"\n";
break;
}
}
}
}