Cod sursa(job #1318558)
| Utilizator | Data | 16 ianuarie 2015 09:09:11 | |
|---|---|---|---|
| Problema | Cautare binara | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.81 kb |
#include <fstream>
#include <iostream>
using namespace std;
int n,m,a[100002],tip,i,nr,st,dr,mid;
int main ()
{
ifstream fin("cautbin.in");
ofstream fout("cautbin.out");
fin>>n;
for(i=1;i<=n;i++)
fin>>a[i];
fin>>m;
for(i=1;i<=m;i++)
{
fin>>tip;
fin>>nr;
st=1;
dr=n;
while(st<=dr)
{
mid=(st+dr)/2;
if(a[mid]<=nr)
{
st=mid+1;
}
else
{
if(a[mid]>nr)
{
dr=mid-1;
}
}
}
if(a[dr]==nr)
{
fout<<dr<<'\n';
}
else fout<<-1<<'\n';
}
fin.close();
fout.close();
return 0;
}
