Mai intai trebuie sa te autentifici.
Cod sursa(job #1930659)
Utilizator | Data | 19 martie 2017 10:39:03 | |
---|---|---|---|
Problema | Cautare binara | Scor | 40 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.94 kb |
#include <fstream>
using namespace std;
ifstream f("cautbin.in");
ofstream g("cautbin.out");
int i,j,n,nr,x,v[100001],k,nr1;
int caut_bin(int val)
{
int index=0,p2=1;
while(p2<n)
p2=(p2<<1);
while(p2>0)
{
if(p2+index<n&&val>=v[index+p2])
index=index+p2;
p2=(p2>>1);
}
return index;
}
int main()
{
f>>n;
for(i=0;i<n;i++)
f>>v[i];
f>>k;
for(i=1;i<=k;i++)
{
f>>nr>>x;
nr1=caut_bin(x);
if(nr==0)
{
if(v[nr1]==x)
g<<nr1+1<<'\n';
else g<<-1<<'\n';}
else if(nr==2)
{
if(v[nr1]==x)
g<<nr1+1<<'\n';
else g<<nr1+2<<'\n';
}
else
{
if(v[nr1-1]==x)
{while(v[nr1]==x)
nr1--;}
g<<nr1+1<<'\n';
}
}
return 0;
}