Pagini recente » Cod sursa (job #378053) | Cod sursa (job #2095740) | Cod sursa (job #990091) | Cod sursa (job #1184034) | Cod sursa (job #2334539)
#include <bits/stdc++.h>
using namespace std;
int v[100000];
ifstream in("cautbin.in");
ofstream out("cautbin.out");
int cerinta0(int val)
{
int pos=0;
for(int msk=1<<20; msk>0; msk/=2)
if(pos+msk<=n && v[pos+msk]<=val)
pos+=msk;
if(v[pos]==val)
return pos;
else return -1;
}
int cerinta1(int val)
{
int pos=0;
for(int msk=1<<20; msk>0; msk/=2)
if(pos+msk<=n && v[pos+msk]<=val)
pos+=msk;
if(v[pos]<=val)
return pos;
}
int cerinta2(int val)
{
int pos=0;
for(int msk=1<<20; msk>0; msk/=2)
if(pos+msk<=n && v[pos+msk]<=val)
pos+=msk;
if(v[pos]==val)
return pos;
else return -1;
}
int main()
{
int n,m,i,j,c,x;
in>>n;
for(i=1;i<=n;i++)
{
in>>v[i];
}
in>>m;
for(j=1;j<=m;j++)
{
in>>c>>x;
}
if(c==0)
out<<cerinta0(x);
else if(c==1)
out<<cerinta1(x);
else if(c==2)
out<<cerinta2(x);
return 0;
}