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