Cod sursa(job #2071907)
| Utilizator | Data | 21 noiembrie 2017 09:57:04 | |
|---|---|---|---|
| Problema | Cautare binara | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 1.02 kb |
#include <bits/stdc++.h>
#define NMAX 100001
using namespace std;
ifstream f("cautbin.in");
ofstream g("cautbin.out");
int n,v[NMAX],m;
int bs(int op,int x)
{
int pas=1<<16,r=0;
if(op==0)
{
while(pas)
{
if(r+pas<=n&&v[r+pas]<=x)
{
if(v[r+pas]==x)
return r+pas;
r+=pas;
}
pas/=2;
}
return -1;
}
else
if(op==1)
{
while(pas)
{
if(r+pas<=n&&v[r+pas]<=x)
r+=pas;
pas/=2;
}
return r;
}
else
{
while(pas)
{
if(r+pas<=n&&v[r+pas]<x)
r+=pas;
pas/=2;
}
return r+1;
}
return 0;
}
int main()
{
int m,op,x;
f>>n;
for(int i=1;i<=n;++i)
f>>v[i];
f>>m;
while(m--)
{
f>>op>>x;
g<<bs(op,x)<<"\n";
}
return 0;
}
