Cod sursa(job #2754976)
Utilizator | Data | 26 mai 2021 18:28:28 | |
---|---|---|---|
Problema | Cautare binara | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 1.5 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("cautbin.in");
ofstream g("cautbin.out");
int main()
{
int n,i,c,x,p,m,u,mij,poz,v[100100];
f>>n;
for(int i=1; i<=n; i++)f>>v[i];
f>>m;
for(int i=1; i<=m; i++)
{
f>>c>>x;
if(c==0)
{
p=1;
u=n;
poz=-1;
while(p<=u)
{
mij=(p+u)/2;
if(v[mij]<=x)
{
poz=mij;
p=mij+1;
}
else
u=mij-1;
}
if(v[poz]==x)
g<<poz<<'\n';
else
g<<-1<<'\n';
}
else if(c==1)
{
p=1;
u=n;
poz=-1;
while(p<=u)
{
mij=(p+u)/2;
if(v[mij]<=x)
{
poz=mij;
p=mij+1;
}
else u=mij-1;
}
g<<poz<<'\n';
}
else
{
p=1;
u=n;
poz=-1;
while(p<=u)
{
mij=(p+u)/2;
if(v[mij]>=x)
{
poz=mij;
u=mij-1;
}
else p=mij+1;
}
g<<poz<<'\n';
}
}
return 0;
}