Mai intai trebuie sa te autentifici.
Cod sursa(job #2209701)
| Utilizator | Data | 4 iunie 2018 12:37:08 | |
|---|---|---|---|
| Problema | Cautare binara | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.89 kb |
#include <iostream>
#include <fstream>
std::ifstream in("cautbin.in");
std::ofstream out("cautbin.out");
using namespace std;
int n,a,sir[5000000],test,poz;
int cautbin(int x)
{
int poz=0;
for(int i=19;i>=0;--i)
{
if(poz+(1<<i)<=n && sir[poz+(1<<i)]<=x)
{
poz+=(1<<i);
}
}
return poz;
}
int main()
{
in>>n;
for(int i=1;i<=n;++i)
{
in>>sir[i];
}
in>>test;
for(int i=0;i<test;i++)
{
in>>a>>poz;
int p;
if(a<2)
{
p=cautbin(poz);
if(sir[p]==poz)
out<<p<<'\n';
else out<<-1<<'\n';
}
else if(a==2)
{
p=cautbin(poz-1)+1;
if(sir[p]==poz)
out<<p<<'\n';
else out<<-1<<'\n';
}
}
return 0;
}
