Cod sursa(job #2736921)
Utilizator | Dragan Andrei AndreiD31 | Data | 4 aprilie 2021 10:41:17 |
---|---|---|---|
Problema | Cautare binara | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 1.1 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream f("cautbin.in");
ofstream g("cautbin.out");
int n,i,m,pz,u,p,mij,c,x,v[100100];
int main()
{
f>>n;
for(i=1;i<=n;i++)
{
f>>v[i];
}
f>>m;
for(i=1;i<=m;i++)
{
f>>c>>x;
if(c==0)
{
p=1;u=n;pz=-1;
while(p<=u)
{
mij=(p+u)/2;
if(v[mij]==x)pz=mij,p=mij+1;
else if(v[mij]<x)p=mij+1;
else u=mij-1;
}
g<<pz<<'\n';
}
else if(c==1)
{
p=1;u=n;pz=-1;
while(p<=u)
{
mij=(p+u)/2;
if(v[mij]<=x)pz=mij,p=mij+1;
else u=mij-1;
}
g<<pz<<'\n';
}
else
{
p=1;u=n;pz=-1;
while(p<=u)
{
mij=(p+u)/2;
if(v[mij]>=x)pz=mij,u=mij-1;
else p=mij+1;
}
g<<pz<<'\n';
}
}
return 0;
}