Cod sursa(job #2681186)
Utilizator | Data | 5 decembrie 2020 09:40:20 | |
---|---|---|---|
Problema | Cautare binara | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.89 kb |
#include <fstream>
using namespace std;
ifstream cin("cautbin.in");
ofstream cout("cautbin.out");
int main()
{
int n,lf,rg,nr,m,ans=0;
cin>>n;
lf=0;
rg=n-1;
int v[n];
for(int i=0;i<n;i++)
{
cin>>v[i];
}
cin>>m;
while(m)
{
cin>>nr;
if(nr==0 || nr==1)
{
while(lf<=rg)
{
med=(lf+rg)/2;
if(v[med]<=nr)
{
ans=med;
lf=med+1;
}
else rg=med-1;
}
}
else
{
while(lf<=rg)
{
med=(lf+rg)/2;
if(v[med]>=nr)
{
ans=med;
rg=med-1;
}
else lf=med+1;
}
}
cout<<ans<<endl;
m--;
}
return 0;
}