Cod sursa(job #2754990)
Utilizator | Data | 26 mai 2021 18:44:56 | |
---|---|---|---|
Problema | Cautare binara | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 2.59 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream in ("cautbin.in");
ofstream out ("cautbin.out");
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, v[100001], 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)
{
if(st == dr)
{
if(v[st] == x)
{
poz = st;
}
break;
}
mij = (st + dr) / 2;
if(v[mij] < x)
{
st = mij + 1;
}
if(v[mij] == x)
{
poz = mij;
st = mij + 1;
}
if(v[mij] < x)
{
dr = mij - 1;
}
}
out << poz + 1 << "\n";
}
else if(q == 1)
{
int st = 0, dr = n - 1;
int mij, poz = -1;
while(st <= dr)
{
if(st == dr)
{
if(v[st] <= x)
{
poz = dr;
}
break;
}
mij = (st + dr) / 2;
if(v[mij] > x)
{
dr = mij - 1;
}
if(v[mij] <= x)
{
poz = mij;
st = mij + 1;
}
}
out << poz + 1 << "\n";
}
else if(q == 2)
{
int st = 0, dr = n - 1;
int mij, poz = -1;
while(st <= dr)
{
if(st == dr)
{
if(v[st] >= x)
{
poz = st;
}
break;
}
mij = (st + dr) / 2;
if(v[mij] >= x)
{
poz = mij;
dr = mij - 1;
}
if(v[mij] < x)
{
st = mij + 1;
}
}
out << poz + 1 << "\n";
}
}
return 0;
}