Cod sursa(job #2480410)
| Utilizator | Data | 25 octombrie 2019 16:20:31 | |
|---|---|---|---|
| Problema | Cautare binara | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.84 kb |
#include <fstream>
using namespace std;
ifstream fin("cautbin.in");
ofstream fout("cautbin.out");
int x, m, n, v[100001], a, b, st, dr, mi, i;
bool ok;
int main()
{
fin>>n;
for(i=1; i<=n; i++)
fin>>v[i];
fin>>m;
for(i=1; i<=m; i++)
{
fin>>a>>b;
st=1;
dr=n;
if(a==0)
{
ok=false;
while(st<=dr && ok==false)
{
mi=(st+dr)/2;
if(b==v[mi])
ok=true;
else
{
if(b<v[mi])
dr=mi-1;
else
st=mi+1;
}
}
if(ok==true)
fout<<mi;
else
fout<<-1;
}
}
return 0;
}
