Pagini recente » Cod sursa (job #1627242) | Cod sursa (job #2747026) | Cod sursa (job #566303) | Cod sursa (job #2427875) | Cod sursa (job #1807479)
#include <fstream>
using namespace std;
ifstream f("cautbin.in");
ofstream g("cautbin.out");
int v[100005],n,mij,st,dr,i,j,k,ok,x,c,poz;
int caut0()
{
st=1;
dr=n;
poz=-1;
while(st<=dr)
{
mij=(st+dr)/2;
if(v[mij]==x)
{
poz=mij;
st=mij+1;
}
else
if(v[mij]<x)
st=mij+1;
else
dr=mij-1;
}
return poz;
}
int caut1(){
st=1;
dr=n;
poz=-1;
while(st<=dr)
{
mij=(st+dr)/2;
if(v[mij]<=x)
{
poz=mij;
st=mij+1;
}
else
{
dr=mij-1;
}
}
return poz;
}
int caut2()
{
st=1;
dr=n;
poz=-1;
while(st<=dr)
{
mij=(st+dr)/2;
if(v[mij]>=x)
poz=mij,dr=mij-1;
else
st=mij+1;
}
return poz;
}
int main()
{
f>>n;
for(i=1;i<=n;i++)
f>>v[i];
f>>k;
for(i=1;i<=k;i++)
{
f>>c>>x;
switch(c)
{
case 0: g<<caut0()<<'\n' ;break;
case 1: g<<caut1()<<'\n' ;break;
case 2: g<<caut2()<<'\n' ;break;
}
}
return 0;
}