Cod sursa(job #3360529)
| Utilizator | Data | 14 iulie 2026 15:03:26 | |
|---|---|---|---|
| Problema | Cautare binara | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 1.35 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("cautbin.in");
ofstream out("cautbin.out");
int v[100000];
int main()
{
int n=0, x=0, q=0, i=0, m=0, st=0, dr=0, mij=0;
in>>n;
for(i=0; i<n; i++)
{
in>>v[i];
}
in>>m;
for(i=0; i<m; i++)
{
in>>q>>x;
if(q<2)
{
st=0;
dr=n-1;
while(st<=dr)
{
mij=(st+dr)/2;
if(v[mij]<=x)
{
st=mij+1;
}
else
{
dr=mij-1;
}
}
if(q==0){
if(v[dr]==x){
out<<st<<"\n";
}
else{
out<<"-1"<<"\n";
}
}
if(q==1){
out<<st<<"\n";
}
}
else
{
st=0;
dr=n-1;
while(st<=dr)
{
mij=(st+dr)/2;
if(v[mij]<x)
{
st=mij+1;
}
else
{
dr=mij-1;
}
}
out<<st+1<<"\n";
}
}
return 0;
}
