Cod sursa(job #1987389)
Utilizator | Data | 30 mai 2017 17:14:42 | |
---|---|---|---|
Problema | Cautare binara | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 1.13 kb |
#include <fstream>
using namespace std;
ifstream fin("cautbin.in");
ofstream fout("cautbin.out");
int n,i,v[100001],t,x,st,dr,m,mid;
int main()
{
fin>>n;
for(i=1;i<=n;i++)
fin>>v[i];
fin>>m;
for(i=1;i<=m;i++){
fin>>t>>x;
if(t==0){
st=1;dr=n;
while(st<=dr){
mid=(st+dr)/2;
if(v[mid]<=x)
st=mid+1;
else
dr=mid-1;
}
if(v[dr]==x)
fout<<dr<<"\n";
else
fout<<"-1"<<"\n";
}
if(t==1){
st=1;dr=n;
while(st<=dr){
mid=(st+dr)/2;
if(v[mid]<=x)
st=mid+1;
else dr=mid-1;
}
fout<<dr<<"\n";
}
if(t==2){
st=1;dr=n;
while(st<=dr){
mid=(st+dr)/2;
if(v[mid]>=x)
dr=mid-1;
else st=mid+1;
}
fout<<st<<"\n";
}
}
return 0;
}