Pagini recente » Cod sursa (job #2680616) | Cod sursa (job #2218370) | Cod sursa (job #2341506) | Cod sursa (job #2598332) | Cod sursa (job #1869906)
#include <bits/stdc++.h>
using namespace std;
int a[100005];
int CB0(int st , int dr ,int x)
{
int mij,p=-1;
while(st<=dr)
{
mij=(st+dr)/2;
if(a[mij]==x)
{
p=mij;
st=mij+1;
}
else if(x<a[mij]) dr=mij-1;
else st=mij+1;
}
return p;
}
int CB1(int st , int dr ,int x)
{
int mij,p=-1;
while(st<=dr)
{
mij=(st+dr)/2;
if(a[mij]<=x)
{
p=mij;
st=mij+1;
}
else dr=mij-1;
}
return p;
}
int CB2(int st , int dr ,int x)
{
int mij,p=-1;
while(st<=dr)
{
mij=(st+dr)/2;
if(a[mij]>=x)
{
p=mij;
dr=mij-1;
}
else st=mij+1;
}
return p;
}
int main()
{
int n,i,op,q,x;
ifstream fin ("cautbin.in");
ofstream fout ("cautbin.out");
fin>>n;
for(i=1;i<=n;i++)
fin>>a[i];
fin>>q;
for(i=1;i<=q;i++)
{
fin>>op>>x;
if(op==0)
{
fout<<CB0(1,n,x)<<"\n";
}
else if(op==1)
{
fout<<CB1(1,n,x)<<"\n";
}
else if(op==2)
{
fout<<CB2(1,n,x)<<"\n";
}
}
fout.close();
fin.close();
return 0;
}