Cod sursa(job #899844)
Utilizator | Data | 28 februarie 2013 16:38:34 | |
---|---|---|---|
Problema | Cautare binara | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 1.39 kb |
#include <fstream>
using namespace std;
ifstream f("cautbin.in");
ofstream g("cautbin.out");
int main()
{
int t,n,x,k,i,st,dr,mij,sol,v[100001];
f>>n;
for(i=1;i<=n;++i)
f>>v[i];
f>>t;
while(t--)
{
f>>k>>x;
st=1;
dr=n;
if(k==0)
{
sol=-1;
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
dr=mij-1;
}
g<<sol<<"\n";
}
if(k==1)
{
while(st<=dr)
{
mij=(st+dr)/2;
if(x>=v[mij])
{
sol=mij;
st=mij+1;
}
else
dr=mij-1;
}
g<<sol<<"\n";
}
if(k==2)
{
while(st<=dr)
{
mij=(st+dr)/2;
if(x<=v[mij])
{
sol=mij;
dr=mij-1;
}
else
st=mij+1;
}
g<<sol<<"\n";
}
}
return 0;
}