Pagini recente » Cod sursa (job #3154088) | Cod sursa (job #385400) | Cod sursa (job #1805887) | Cod sursa (job #2551764) | Cod sursa (job #2803128)
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("cautbin.in");
ofstream out("cautbin.out");
const int maxn = 100005;
int v[maxn];
int n;
int cautbin1(int x)
{
int st = 1;
int dr = n;
int raspuns = -1;
while(st <= dr)
{
int mij = (st + dr) / 2;
if(v[mij] <= x)
{
raspuns = mij;
st = mij + 1;
}
else
dr = mij - 1;
}
return raspuns;
}
int cautbin2(int x)
{
int st = 1;
int dr = n;
int raspuns = -1;
while(st <= dr)
{
int mij = (st + dr) / 2;
if(v[mij] >= x)
{
raspuns = mij;
dr = mij - 1;
}
else
st = mij + 1;
}
return raspuns;
}
int main()
{
int m;
in >> n;
for(int i = 1; i <= n; i++)
in >> v[i];
in >> m;
for(int i = 1; i <= m; i++)
{
int op, x;
in >> op >> x;
if(op == 0)
{
int rasp = cautbin1(x);
if(rasp == -1)
out << -1;
else if(v[rasp] != x)
out << -1;
else
out << rasp;
}
else if(op == 1)
out << cautbin1(x);
else
out << cautbin2(x);
out << "\n";
}
return 0;
}