Cod sursa(job #2567657)
Utilizator | Data | 3 martie 2020 18:16:31 | |
---|---|---|---|
Problema | Cautare binara | Scor | 40 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 2.05 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("cautbin.in");
ofstream g("cautbin.out");
int n,m,v[100001],y,x;
int cautare_binara()
{
int lo=0,hi=n+1,mij;
while(hi-lo>1)
{
mij=(lo+hi)/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=(lo+hi)/2;
if(v[mij]<x)
lo=mij;
else
hi=mij;
}
if(hi<n+1&&v[hi]==x)
return hi;
else
return -1;
}
int main()
{
int i,ok,ok2,k;
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_binara();
g<<k<<'\n';
}
if(y==1)
{
ok=0;
k=cautare_binara();
if(k==-1)
{
while(ok!=1)
{
x--;
k=cautare_binara();
if(k!=-1)
{
g<<k<<'\n';
ok=1;
}
}
}
else
{
g<<k<<'\n';
}
}
if(y==2)
{
ok2=0;
k=cautare_binara();
if(k==-1)
{
while(ok2!=1)
{
x++;
k=cautare_binara2();
if(k!=-1)
{
g<<k<<'\n';
ok2=1;
}
}
}
else
{
k=cautare_binara2();
g<<k<<'\n';
}
}
m--;
}
return 0;
}