Cod sursa(job #2574914)
Utilizator | Data | 6 martie 2020 10:39:45 | |
---|---|---|---|
Problema | Cautare binara | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 1.54 kb |
#include <fstream>
using namespace std;
ifstream fin ("cautbin.in");
ofstream fout ("cautbin.out");
int n, v[100001], m, a, x, b, mij, st, dr;
int main()
{
fin >> n;
for (int i=1; i<=n; i++)
fin >> v[i];
fin >> m;
for (int i=1; i<=m; i++)
{
fin >> a >> x;
if (a==0)
{
st=1;
dr=n;
b=-1;
while (st<=dr)
{
mij=(st+dr)/2;
if (v[mij]==x)
{
b=mij;
st=mij+1;
}
else if (x>v[mij])
st=mij+1;
else
dr=mij-1;
}
fout << b << '\n';
}
if (a==1)
{
st=1;
dr=n;
while (st<=dr)
{
mij=(st+dr)/2;
if (x>=v[mij])
{
b=mij;
st=mij+1;
}
else
dr=mij-1;
}
fout << b << '\n';
}
if (a==2)
{
st=1;
dr=n;
while (st<=dr)
{
mij=(st+dr)/2;
if (v[mij]>=x)
{
b=mij;
dr=mij-1;
}
else
st=mij+1;
}
fout << b << '\n';
}
}
return 0;
}