Cod sursa(job #3166893)
Utilizator | Data | 9 noiembrie 2023 18:51:32 | |
---|---|---|---|
Problema | Cautare binara | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 1.42 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("cautbin.in");
ofstream fout("cautbin.out");
int n,m,x,v[1000001],c,y,dr,st,mid;
int main()
{
fin>>n;
for(int i=1;i<=n;i++){
fin>>v[i];
}
fin>>m;
for(int i=1;i<=m;i++){
fin>>c>>x;
if(c==0){
int st=1,dr=n,mid;
while(st<=dr){
mid=(st+dr)/2;
if(v[mid]==x)
break;
else if(v[mid]<x)
st=mid+1;
else
dr=mid-1;
}
if(st<=dr){
y=mid;
while(v[y]==x)
y++;
fout<<y-1<<"\n";
}
else
fout<<-1<<"\n";
}
else if(c==1){
st = 1;
dr = n;
while (st <= dr) {
mid = (st + dr) / 2;
if (v[mid] >x)
dr = mid-1;
else
st = mid+1;
}
fout<<dr<<"\n";
}
else{
st = 1;
dr = n;
while (st <= dr) {
mid = (st + dr) / 2;
if (v[mid] <x)
st = mid+1;
else
dr = mid-1;
}
fout<<st<<"\n";
}
}
return 0;
}