Cod sursa(job #3302723)
| Utilizator | Data | 10 iulie 2025 13:06:00 | |
|---|---|---|---|
| Problema | Cautare binara | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 1.6 kb |
#include <bits/stdc++.h>
/// Template Dutzu
using namespace std;
ifstream fin("cautbin.in");
ofstream fout("cautbin.out");
int v[100001],x;
int main()
{
int n,m;
fin>>n;
for (int i=1;i<=n;i++)
fin>>v[i];
fin>>m;
for (int i=1;i<=m;i++)
{
int a;
fin>>a>>x;
if (a==0)
{
int st=1,dr=n,mij,rez=-1;
while(st<=dr)
{
mij=1LL*(st+dr)/2;
if (v[mij]<=x)
{
st=mij+1;
if (v[mij]==x)
rez=mij;
}
else
dr=mij-1;
}
fout<<rez<<'\n';
}
if (a==1)
{
int st=1,dr=n,mij,rez;
while(st<=dr)
{
mij=1LL*(st+dr)/2;
if (v[mij]<=x)
{
st=mij+1;
rez=mij;
}
else
dr=mij-1;
}
fout<<rez<<'\n';
}
if (a==2)
{
int st=1,dr=n,mij,rez;
while(st<=dr)
{
mij=1LL*(st+dr)/2;
if (v[mij]<x)
{
st=mij+1;
if (v[mij+1]==x)
rez=mij+1;
else
rez=mij;
}
else
dr=mij-1;
}
fout<<rez<<'\n';
}
}
return 0;
}
