Pagini recente » Cod sursa (job #2441860) | Cod sursa (job #708251) | Cod sursa (job #2221913) | Cod sursa (job #1327809) | Cod sursa (job #1358655)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("cautbin.in");
ofstream g("cautbin.out");
int n,indice,tip,val;
int v[100005];
int cautarebin1(int x){
int m,st=1,dr=n;
while(st<dr){
m=(st+dr)/2;
if(x>=v[m])
st=m+1;
if(x>=v[m])
dr=m-1;
}
cout<<st<<dr;
m=(st+dr)/2;
if(v[m] == x)
return m;
return -1;
}
int cautarebin2(int x){
int m,st=1,dr=n;
while(st<dr){
m=(st+dr)/2;
if(x>=v[m])
st=m+1;
if(x>=v[m])
dr=m-1;
}
return (st+dr)/2;
}
int main()
{
f>>n;
for(int i=1;i<=n;++i)
f>>v[i];
f>>indice;
for(int i=1;i<=indice;++i){
f>>tip>>val;
if(tip == 0)
g<<cautarebin1(val)<<'\n';
if(tip == 1)
g<<cautarebin2(val)<<'\n';
}
return 0;
}