Pagini recente » Cod sursa (job #2483723) | Cod sursa (job #2544490) | Cod sursa (job #928977) | Cod sursa (job #206604) | Cod sursa (job #1626260)
#include <fstream>
using namespace std;
ifstream f("cautbin.in");
ofstream g("cautbin.out");
int n,m,a[100001];
int caut_bin_0(int st, int dr, int k)
{
int mij;
while(st<=dr)
{
mij=(st+dr)>>1;
if(a[mij]>=k)
st=mij+1;
else
dr=mij-1;
}
if(a[mij-1]==k)
return mij-1;
return -1;
}
int caut_bin_1(int st, int dr, int k)
{
int mij;
while(st<=dr)
{
mij=(st+dr)>>1;
if(a[mij]<=k)
st=mij+1;
else
dr=mij-1;
}
if(a[mij-1]==k)
return mij-1;
return -1;
}
int caut_bin_2(int st, int dr, int k)
{
int mij;
while(st<=dr)
{
mij=(st+dr)>>1;
if(a[mij]>=k)
dr=mij-1;
else
st=mij+1;
}
if(a[mij]==k)
return mij;
return -1;
}
int main()
{
int i,x,val;
f>>n;
for(i=1; i<=n; i++)
f>>a[i];
f>>m;
for(i=1; i<=m; i++)
{
f>>x>>val;
if(x==0)
g<<caut_bin_0(1,n,val)<<'\n';
else if(x==1)
g<<caut_bin_1(1,n,val)<<'\n';
else
g<<caut_bin_2(1,n,val)<<'\n';
}
return 0;
}