Cod sursa(job #3141000)
| Utilizator | Data | 11 iulie 2023 18:29:40 | |
|---|---|---|---|
| Problema | Cautare binara | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 1.29 kb |
#include <fstream>
using namespace std;
ifstream in("cautbin.in");
ofstream out("cautbin.out");
int v[100001];
int main()
{
int n, m, t, x;
in >> n;
for(int i = 1; i <= n; i++)
in >> v[i];
in >> m;
for(int i = 1; i <= m; i++)
{
in >> t;
if(t == 0)
{
in >> x;
int r = 0, pas = 1 << 16;
while(pas != 0)
{
if(r + pas <= n && v[r + pas] <= x)
r += pas;
pas /= 2;
}
if(v[r] == x)
out << r << '\n';
else
out << "-1\n";
}
else if(t == 1)
{
in >> x;
int r = 0, pas = 1 << 16;
while(pas != 0)
{
if(r + pas <= n && v[r + pas] <= x)
r += pas;
pas /= 2;
}
out << r << '\n';
}
else
{
in >> x;
int r = 0, pas = 1 << 16;
while(pas != 0)
{
if(r + pas <= n && v[r + pas] < x)
r += pas;
pas /= 2;
}
out << r + 1 << '\n';
}
}
return 0;
}
