Pagini recente » Cod sursa (job #670217) | Cod sursa (job #1042879) | Cod sursa (job #2364421) | Cod sursa (job #968211) | Cod sursa (job #2755028)
#include <iostream>
#include <fstream>
using namespace std;
ifstream in ("cautbin.in");
ofstream out ("cautbin.out");
int v[100001];
void Read(int &n, int &m, int v[])
{
in >> n;
for(int i = 0; i < n; i++)
{
in >> v[i];
}
in >> m;
}
int main()
{
int n, m, x, q;
Read(n, m, v);
while(m--)
{
in >> q >> x;
if(q == 0)
{
int st = 0, dr = n - 1;
int mij, poz = -1;
while(st <= dr)
{
mij = (st + dr) / 2;
if(v[mij] <= x)
{
poz = mij;
st = mij + 1;
}
else
{
dr = mij - 1;
}
}
if(v[poz] == x)
{
out << poz + 1 << "\n";
}
else
{
out << -1 << "\n";
}
}
else if(q == 1)
{
int st = 0, dr = n - 1;
int mij, poz = -1;
while(st <= dr)
{
mij = (st + dr) / 2;
if(v[mij] <= x)
{
poz = mij;
st = mij + 1;
}
else
{
dr = mij - 1;
}
}
out << poz + 1 << "\n";
}
else if(q == 2)
{
int st = 0, dr = n - 1;
int mij, poz = -1;
while(st <= dr)
{
mij = (st + dr) / 2;
if(v[mij] >= x)
{
poz = mij;
dr = mij - 1;
}
else
{
st = mij + 1;
}
}
out << poz + 1 << "\n";
}
}
return 0;
}