Cod sursa(job #2423102)
Utilizator | Data | 20 mai 2019 19:12:13 | |
---|---|---|---|
Problema | Cautare binara | Scor | 10 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 1.33 kb |
#include <fstream>
using namespace std;
ifstream f("cautbin.in");
ofstream g("cautbin.out");
int n,m,i,j,c,x,s,d,mi,p;
unsigned int a[100001];
int main()
{
f>>n;
for(i=1;i<=n;i++)
f>>a[i];
f>>m;
for(i=1;i<=m;i++)
{
f>>c>>x;
if(c==0)
{
p=-1;
s=1;d=n;
while(s<=d )
{
mi=(s+d)/2;
if(x==a[mi])
{p=mi;s=mi+1;}
else
{
if(x<a[mi])
s=mi+1;
else
d=mi-1;
}
}
g<<p<<endl;
}
if(c==1)
{
p=-1;
s=1;d=n;
while(s<=d )
{
mi=(s+d)/2;
if(x>=a[mi])
{p=mi;s=mi+1;}
else
d=mi-1;
}
g<<p<<endl;
}
if(c==2)
{
p=-1;
s=1;d=n;
while(s<=d )
{
mi=(s+d)/2;
if(x<=a[mi])
{p=mi;d=mi-1;}
else
s=mi+1;
}
g<<p<<endl;
}
}
}