Cod sursa(job #2345913)
| Utilizator | Data | 16 februarie 2019 20:13:43 | |
|---|---|---|---|
| Problema | Cautare binara | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.59 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("cautbin.in");
ofstream fout("cautbin.out");
int n,m,t,x,v[100005],i;
int cautarebin1(int x)
{
int poz=0;
for(int i=1<<30;i>0;i=1>>1)
{
if(poz+i<=n)
if(v[poz+1]<=x)
poz+=i;
}
if(v[poz]==x)
return poz;
else
return -1;
}
int main()
{
fin>>n;
for(i=1;i<=n;i++)
fin>>v[i];
fin>>m;
for(i=1;i<=m;i++)
{
fin>>t>>x;
if(t==0)
fout<<catutarebin1(x)<<endl;
}
return 0;
}
