Cod sursa(job #2249387)
Utilizator | Data | 29 septembrie 2018 18:50:01 | |
---|---|---|---|
Problema | Cautare binara | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 1.6 kb |
#include <fstream>
using namespace std;
int v[100005];
ifstream f("cautbin.in");
ofstream g("cautbin.out");
int n,m,a,b,x,st,dr,mij,i;
int main()
{
f>>n;
x=-1;
for(i=1; i<=n; i++)
{
f>>v[i];
}
f>>m;
for(i=0; i<m; i++)
{
f>>b>>a;
st=1;
dr=n;
if(b==0)
{
x=-1;
while(st<=dr)
{
mij=(st+dr)/2;
if(v[mij]==a)
{
x=mij;
st=mij+1;
}
else if(v[mij]<a)
{
st=mij+1;
}
else
{
dr=mij-1;
}
}
g<<x<<'\n';
}
else if(b==1)
{
x=-1;
while(st<=dr)
{
mij=(st+dr)/2;
if(v[mij]<=a)
{
x=mij;
st=mij+1;
}
else
{
dr=mij-1;
}
}
g<<x<<'\n';
}
else
{
x=-1;
while(st<=dr)
{
mij=(st+dr)/2;
if(v[mij]>=a)
{
x=mij;
dr=mij-1;
}
else
{
st=mij+1;
}
}
g<<x<<'\n';
}
}
return 0;
}