Cod sursa(job #3174712)
Utilizator | Data | 25 noiembrie 2023 09:16:24 | |
---|---|---|---|
Problema | Cautare binara | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 1.96 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("cautbin.in");
ofstream fout("cautbin.out");
int v[100002];
int main()
{
int n, m, c, x, p, p1, p2, mij;
fin >> n;
for(int i=1;i<=n;i++) {
fin >> v[i];
}
fin >> m;
for(int i=1;i<=m;i++) {
fin >> c >> x;
if(c==0) {
p1=1;
p2=n;
p=-1;
while(p1<=p2) {
mij=(p1+p2)/2;
if(v[mij]==x) {
p=mij;
p1=mij+1;
}
else {
if(v[mij]<x) {
p1=mij+1;
}
else {
p2=mij-1;
}
}
}
fout << p << '\n';
}
else if(c==1) {
p1=1;
p2=n;
p=-1;
while(p1<=p2) {
mij=(p1+p2)/2;
if(v[mij]==x) {
p=mij;
p1=mij+1;
}
else {
if(v[mij]<x) {
p=mij;
p1=mij+1;
}
else {
p2=mij-1;
}
}
}
fout << p << '\n';
}
else {
p1=1;
p2=n;
p=-1;
while(p1<=p2) {
mij=(p1+p2)/2;
if(v[mij]==x) {
p=mij;
p2=mij-1;
}
else {
if(v[mij]<x) {
p1=mij+1;
}
else {
p=mij;
p2=mij-1;
}
}
}
fout << p << '\n';
}
}
return 0;
}