Cod sursa(job #2882532)
Utilizator | Data | 31 martie 2022 15:25:06 | |
---|---|---|---|
Problema | Cautare binara | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 1.61 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream in("cautbin.in");
ofstream out("cautbin.out");
int main()
{
int n,m,ok,w;
in>>n;
int v[n+1];
for(int i=1; i<=n; i++)
{
in>>v[i];
}
in>>m;
for(int i=1; i<=m; i++)
{
in>>ok>>w;
if(ok==0)
{
int st=1,dr=n;
while(st<=dr)
{
int mid = (st+dr)/2;
if(v[mid]>w)
{
dr = mid-1;
}
else
{
st = mid+1;
}
}
if(v[dr]==w)
{
out<<dr<<"\n";
}
else
{
out<<"-1"<<"\n";
}
}
if(ok==1)
{
int st=1,dr=n;
while(st<=dr)
{
int mid = (st+dr)/2;
if(v[mid]>w)
{
dr = mid-1;
}
else
{
st = mid+1;
}
}
out<<dr<<"\n";
}
if(ok==2)
{
int st=1,dr=n;
while(st<=dr)
{
int mid = (st+dr)/2;
if(v[mid]>=w)
{
dr = mid-1;
}
else
{
st = mid+1;
}
}
out<<dr+1;
}
}
return 0;
}