Pagini recente » Cod sursa (job #3201628) | Cod sursa (job #2074585)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("cautbin.in");
ofstream g("cautbin.out");
int N, v[100001];
int Caut0(int x)
{
int left = 1, right = N, poz = -1;
while(left <= right)
{
int mid = (left + right) / 2;
if(x == v[mid]) poz = mid;
if(x >= v[mid]) left = mid + 1;
else right = mid - 1;
}
return poz;
}
int Caut1(int x)
{
int left = 1, right = N, poz = -1;
while(left <= right)
{
int mid = (left + right) / 2;
if(x >= v[mid])
{
poz = mid;
left = mid + 1;
}
else right = mid - 1;
}
return poz;
}
int Caut2(int x)
{
int left = 1, right = N, poz = -1;
while(left <= right)
{
int mid = (left + right) / 2;
if(x <= v[mid])
{
poz = mid;
right=mid-1;
}
else left = mid + 1;
}
return poz;
}
int main()
{
int M,op,x;
f >> N;
for(int i = 1; i <= N; i++)
f >> v[i];
f >> M;
for(int i = 1; i <= M; i++)
{
f >> op >> x;
switch(op)
{
case 0:
g << Caut0(x) << '\n';
break;
case 1:
g << Caut1(x) << '\n';
break;
case 2:
g << Caut2(x) << '\n';
break;
}
}
}