Cod sursa(job #2567495)
Utilizator | Data | 3 martie 2020 17:35:21 | |
---|---|---|---|
Problema | Cautare binara | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 2.41 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 x)
{
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 x)
{
int lo=0,hi=n+1,mij;
while(hi-lo>1)
{
mij=(lo+hi)/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;
switch(y)
{
case 0:
{
int k;
f>>x;
k=cautare_binara(x);
g<<k<<'\n';
break;
}
case 1:
{
int k,ok=0;
f>>x;
k=cautare_binara(x);
if(k==-1)
{
for(i=n;i>=1;i--)
{
if(v[i]<=x)
{
k=i;
ok=1;
}
if(ok==1)
break;
}
g<<k<<'\n';
}
else
{
g<<k<<'\n';
}
break;
}
case 2:
{
int k,ok=0;
k=cautare_binara(x);
if(k==-1)
{
for(i=1;i<=n;i++)
{
if(v[i]>=x)
{
k=i;
ok=1;
}
if(ok==1)
break;
}
g<<k<<'\n';
}
else
{
k=cautare_binara2(x);
g<<k<<'\n';
}
break;
}
}
m--;
if(m==0)
break;
}
return 0;
}