Cod sursa(job #1424161)
Utilizator | Data | 23 aprilie 2015 17:26:37 | |
---|---|---|---|
Problema | Cautare binara | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 1.28 kb |
#include <fstream>
using namespace std;
ifstream fin("cautbin.in");
ofstream fout("cautbin.out");
int v[100001],m,p,u,i,j,n,t,x;
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){
p=1;
u=n;
while(p<=u){
int mid;
mid=(p+u)/2;
if(v[mid]<=x)
p=mid+1;
else
u=mid-1;
}
if(v[u]==x)
fout<<u;
else
fout<<-1;
fout<<'\n';
}
if(t==1){
p=1;
u=n;
while(p<=u){
int mid;
mid=(p+u)/2;
if(v[mid]<=x)
p=mid+1;
else
u=mid-1;
}
fout<<u<<'\n';
}
if(t==2){
p=1;
u=n;
while(p<=u){
int mid;
mid=(p+u)/2;
if(v[mid]<x)
p=mid+1;
else
u=mid-1;
}
fout<<p;
fout<<'\n';
}
}
}