Cod sursa(job #2206967)
Utilizator | Data | 24 mai 2018 17:15:30 | |
---|---|---|---|
Problema | Cautare binara | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 1.52 kb |
#include <fstream>
using namespace std;
ifstream f("cautbin.in");
ofstream g("cautbin.out");
int n,i,m,sol,st,dr,mij,v[100005],op,x;
int main()
{
f>>n;
for(i=1; i<=n; ++i)
f>>v[i];
f>>m;
for(i=1; i<=m; ++i)
{
f>>op>>x;
sol=-1;
st=1;
dr=n;
if(op==0)
{
while(st<=dr)
{
mij=(st+dr)/2;
if(v[mij]==x)
{
sol=mij;
st=mij+1;
}
else if(v[mij]<x)
st=mij+1;
else if(v[mij]>x)
dr=mij-1;
}
}
else if(op==1)
{
while(st<=dr)
{
mij=(st+dr)/2;
if(v[mij]<=x)
{
sol=mij;
st=mij+1;
}
else if(v[mij]>x)
dr=mij-1;
}
}
else if(op==2)
{
while(st<=dr)
{
mij=(st+dr)/2;
if(v[mij]>=x)
{
sol=mij;
dr=mij-1;
}
else if(v[mij]<x)
st=mij+1;
}
}
g<<sol<<"\n";
}
return 0;
}