Pagini recente » Cod sursa (job #3266885) | Cod sursa (job #1275766) | Cod sursa (job #491753) | Cod sursa (job #641592) | Cod sursa (job #2167223)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("cautbin.in");
ofstream g("cautbin.out");
int v[100000],n;
int cautare_bin0(int nrc)
{
int st,dr,mid;
st=0;
dr=n-1;
while(st<dr)
{
mid=st+(dr-st+1)/2;
if(nrc<v[mid])
dr=mid-1;
else
st=mid;
}
if(v[st]==nrc)
return ++st;
else
return -1;
}
int cautare_bin1(int nrc)
{
int st,dr,mid;
st=0;
dr=n-1;
while(st<dr)
{
mid=st+(dr-st+1)/2;
if(nrc<v[mid])
dr=mid-1;
else
st=mid;
}
return ++st;
}
int cautare_bin2(int nrc)
{
int st,dr,mid;
st=0;
dr=n-1;
while(st<dr)
{
mid=st+(dr-st)/2;
if(nrc>v[mid])
st=mid+1;
else
dr=mid;
cout<<st<<' '<<mid<<' '<<dr<<endl;
}
return ++st;
}
int main()
{
int m,i,q,x;
f>>n;
for(i=0;i<n;i++)
f>>v[i];
f>>m;
for(i=0;i<m;i++)
{
f>>q>>x;
//g<<x<<endl;
if(q==0)
g<<cautare_bin0(x)<<endl;
else
if(q==1)
g<<cautare_bin1(x)<<endl;
else
g<<cautare_bin2(x)<<endl;
}
return 0;
}