Cod sursa(job #3352610)
| Utilizator | Data | 29 aprilie 2026 14:17:55 | |
|---|---|---|---|
| Problema | Cautare binara | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 1.46 kb |
#include<iostream>
#include<fstream>
using namespace std;
ifstream fin("cautbin.in");
ofstream fout("cautbin.out");
int v[100010];
int main()
{
long long n, m, tip, val, i, p, u, mij, poz;
fin>>n;
for(i=1; i<=n; i++)
fin>>v[i];
fin>>m;
while(m--)
{
fin>>tip>>val;
p=1;
u=n;
if(tip==0)
{
while(p<=u)
{
mij=(p+u)/2;
if(v[mij]<=val)
p=mij+1;
else
u=mij-1;
}
mij=(p+u)/2;
if(v[mij]>val)
mij--;
if(v[mij]==val)
fout<<mij<<"\n";
else
fout<<-1<<"\n";
}
if(tip==1)
{
while(p<u)
{
mij=(p+u)/2;
if(v[mij]<=val)
p=mij+1;
else
u=mij;
}
mij=(p+u)/2;
if(v[mij]>val)
mij--;
fout<<mij<<"\n";
}
if(tip==2)
{
while(p<u)
{
mij=(p+u)/2;
if(v[mij]<val)
p=mij+1;
else
u=mij;
}
mij=(p+u)/2;
if(v[mij]<val)
mij++;
fout<<mij<<"\n";
}
}
return 0;
}
