Pagini recente » Cod sursa (job #2987294) | Cod sursa (job #579223) | Cod sursa (job #2724444) | Cod sursa (job #2691492) | Cod sursa (job #2399617)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("cautbin.in");
ofstream fout("cautbin.out");
constexpr int NX = 100010;
unsigned int a[NX];
int binary0(int st, int dr, int val)
{
int m;
while(st<=dr)
{
m=(st+dr)/2;
if(a[m]<=val)
st=m+1;
else if(a[m]>val)
dr=m-1;
}
m=(st+dr)/2;
if(a[m]>val)
m--;
if(a[m]==val)
return m;
return -1;
}
int binary1(int st, int dr, int val)
{
int m;
while(st<=dr)
{
m=(st+dr)/2;
if(a[m] <= val)
st=m+1;
else if(a[m] > val)
dr=m-1;
}
m=(st+dr)/2;
if(a[m]>val)
m--;
if(a[m]==val)
return m;
return -1;
}
int binary2(int st, int dr, int val)
{
int m;
while(st<=dr)
{
m=(st+dr)/2;
if(a[m] >= val)
dr=m-1;
else if(a[m] < val)
st=m+1;
}
m=(st+dr)/2;
if(a[m]<val)
m++;
if(a[m]==val)
return m;
return -1;
}
int main()
{
unsigned int n, m;
fin>>n;
for(int i=0; i<n; ++i)
fin>>a[i];
fin>>m;
unsigned int x, y;
for(int i=0; i<m; ++i)
{
fin>>x>>y;
switch(x)
{
case 0:
fout<<binary0(0, n-1, y)+1<<" ";
break;
case 1:
fout<<binary1(0, n-1, y)+1<<" ";
break;
case 2:
fout<<binary2(0, n-1, y)+1<<" ";
break;
}
}
return 0;
}