Cod sursa(job #2348921)
Utilizator | Data | 20 februarie 2019 08:38:36 | |
---|---|---|---|
Problema | Cautare binara | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 1.7 kb |
#include <iostream>
#include <fstream>
using namespace std;
int main()
{
long long int v[100005],n,m,i,caut,x,li,ls,mij,g;
ifstream fin("cautbin.in");
ofstream fout("cautbin.out");
fin>>n;
for(i=1;i<=n;i++)
{
fin>>v[i];
}
fin>>m;
for(i=1;i<=m;i++)
{
fin>>caut;
fin>>x;
if(caut==0)
{
li=1;
ls=n;
while(li<=ls)
{
mij=(li+ls)/2;
if(x >= v[mij])
li=mij+1;
else
ls=mij-1;
}
while(mij!=0 && g==0)
{
if(v[mij] > x)
mij--;
if(v[mij]==x)
{
fout<<mij<<endl;
g=1;
}
}
if(mij==0)
fout<<"-1"<<endl;
}
if(caut==1)
{
li=1;
ls=n;
while(li<ls)
{
mij=(li+ls)/2;
if(x >= v[mij])
li=mij+1;
else
ls=mij;
}
if(v[mij] > x)
mij--;
fout<<mij<<endl;
}
if(caut==2)
{
li=1;
ls=n;
while(li<ls)
{
mij=(li+ls)/2;
if(x > v[mij])
li=mij+1;
else
ls=mij;
}
if(v[mij] < x)
mij++;
fout<<mij<<endl;
}
}
fin.close();fout.close();
return 0;
}