Cod sursa(job #2850504)
Utilizator | Data | 16 februarie 2022 21:13:26 | |
---|---|---|---|
Problema | Cautare binara | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 1.41 kb |
#include <fstream>
using namespace std;
ifstream fin ("cautbin.in");
ofstream fout("cautbin.out");
int n,i,T,x,y,st,dr,mid,V[100010];
int main()
{
fin>>n;
for(i=1;i<=n;i++)
fin>>V[i];
fin>>T;
for(i=1;i<=T;i++)
{
fin>>x>>y;
if(x==0)
{
st=1;
dr=n;
while(st<=dr)
{
mid=(st+dr)/2;
if(V[mid]<=y)
st=mid+1;
else
dr=mid-1;
}
if(dr>0&&V[dr]==y)
fout<<dr<<"\n";
else
fout<<-1<<"\n";
}
else
if(x==1)
{
st=1;
dr=n;
while(st<=dr)
{
mid=(st+dr)/2;
if(V[mid]<=y)
st=mid+1;
else
dr=mid-1;
}
fout<<dr<<"\n";
}
else
{
st=1;
dr=n;
while(st<=dr)
{
mid=(st+dr)/2;
if(V[mid]<y)
st=mid+1;
else
dr=mid-1;
}
fout<<st<<"\n";
}
}
return 0;
}