Pagini recente » Cod sursa (job #1451748) | Cod sursa (job #2163800) | Cod sursa (job #1684274) | Cod sursa (job #721182) | Cod sursa (job #2158216)
#include <fstream>
using namespace std;
#define nMax 100001
ifstream fin("cautbin.in");
ofstream fout("cautbin.out");
int n,q,x,m,k,i,v[nMax],st,dr;
int bin0 (int x)
{
st = 1, dr = n;
while (st <= dr)
{
m = (st+dr)/2;
if (v[m] <= x)
st = m+1;
else
dr = m-1;
}
m = (st+dr)/2;
if (v[m] > x)
m--;
if (v[m] == x)
return m;
return -1;
}
int bin1(int x)
{
st = 1, dr = n;
while (st < dr)
{
m = (st+dr)/2;
if (v[m] <= x)
st = m+1;
else
dr = m-1;
}
m = (st+dr)/2;
if (v[m] > x)
m--;
if (v[m] <= x)
return m;
return -1;
}
int bin2(int x)
{
st = 1, dr = n;
while (st < dr)
{
m = (st+dr)/2;
if (v[m] < x)
st = m+1;
else
dr = m;
}
m = (st+dr)/2;
if (v[m] < x)
m++;
return m;
return -1;
}
int main()
{
fin>>n;
for(i=1; i<=n; i++)
fin>>v[i];
fin>>k;
for(i=1; i<=k; i++)
{
fin>>q>>x;
if(q==0)fout<<bin0(x)<<'\n';
else if(q==1)fout<<bin1(x)<<'\n';
else fout<<bin2(x)<<'\n';
}
}