Cod sursa(job #2627325)
Utilizator | Data | 10 iunie 2020 14:15:16 | |
---|---|---|---|
Problema | Cautare binara | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 1.48 kb |
#include<iostream>
#include<fstream>
using namespace std;
ifstream fin("cautbin.in");
ofstream fout("cautbin.out");
int N,v[100],M,intr,x;
int main()
{
fin>>N;
int poz=-1,mij;
for(int i=0;i<N;i++){
fin>>v[i];
}
fin>>M;
int st=1,dr=N;
while(M){
fin>>intr>>x;
if(intr==0){
while(st<=dr)
{
mij=(st+dr)/2;
if(v[mij]==x)
{
poz=mij;
st=mij+1;
}
else if(v[mij]<x)
{
st=mij+1;
}
else
dr=mij-1;
}
fout<<poz+1<<"\n";
M--;
st=1;
dr=N;
}
if(intr==1){
while(st<=dr)
{
mij=(st+dr)/2;
if(v[mij]<=x)
{
poz=mij;
st=mij+1;
}
else if(v[mij]<x)
{
st=mij+1;
}
else
dr=mij-1;
}
fout<<poz+1<<"\n";
M--;
st=1;
dr=N;
}
if(intr==2){
while(st<=dr)
{
mij=(st+dr)/2;
if(v[mij]>=x)
{
poz=mij;
dr=mij-1;
}
else if(v[mij]<x)
{
st=mij+1;
}
else
dr=mij-1;
}
fout<<poz+1<<"\n";
M--;
st=1;
dr=N;
}
}
}