Cod sursa(job #2863375)
| Utilizator | Data | 6 martie 2022 17:10:15 | |
|---|---|---|---|
| Problema | Cautare binara | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 1.15 kb |
int cautare_binara1()
{
int lo=0,hi=n+1,mij;
while(hi-lo>1)
{
mij=(hi+lo)/2;
if(v[mij]>x)
hi=mij;
else
lo=mij;
}
if(lo<n+1&&v[lo]==x)
return lo;
else
return -1;
}
int cautare_binara2()
{
int lo=0,hi=n+1,mij;
while(hi-lo>1)
{
mij=(hi+lo)/2;
if(v[mij]>x)
hi=mij;
else
lo=mij;
}
return lo;
}
int cautare_binara3()
{
int lo=0,hi=n+1,mij;
while(hi-lo>1)
{
mij=(hi+lo)/2;
if(v[mij]<x)
lo=mij;
else
hi=mij;
}
return hi;
}
int main()
{
int i;
f>>n;
for(i=1;i<=n;i++)
{
f>>v[i];
}
f>>m;
while(m>0)
{
f>>y;
f>>x;
if(y==0)
{
k=cautare_binara1();
g<<k<<'\n';
}
if(y==1)
{
k=cautare_binara2();
g<<k<<'\n';
}
if(y==2)
{
k=cautare_binara3();
g<<k<<'\n';
}
m--;
}
return 0;
}
