Cod sursa(job #2805890)
Utilizator | Data | 22 noiembrie 2021 05:22:44 | |
---|---|---|---|
Problema | Cautare binara | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 1.39 kb |
#include <iostream>
#include <fstream>
#include <vector>
using namespace std;
ifstream fin("cautbin.in");
ofstream fout("cautbin.out");
int n, v[100001], m, q, nr, st, dr, mid;
int main()
{
fin >> n;
for(int i = 1; i <= n; i++)
fin >> v[i];
fin >> m;
for(int i = 1; i <= m; i++)
{
fin >> q >> nr;
if(q == 0)
{
st = 1; dr = n;
while(st <= dr)
{
mid = (st + dr) / 2;
if(v[mid] > nr)
dr = mid - 1;
else st = mid + 1;
}
if(v[dr] == nr)
fout << dr << "\n";
else fout << "-1" << "\n";
}
else if(q == 1)
{
st = 1; dr = n;
while(st <= dr)
{
mid = (st + dr) / 2;
if(v[mid] > nr)
dr = mid - 1;
else
st = mid + 1;
}
fout << dr << "\n";
}
else if(q == 2)
{
st = 1; dr = n;
while(st <= dr)
{
mid = (st + dr) / 2;
if(v[mid] < nr)
st = mid + 1;
else
dr = mid - 1;
}
fout << st << "\n";
}
}
return 0;
}