Pagini recente » Cod sursa (job #68641) | Cod sursa (job #3234633) | Cod sursa (job #3234736) | Cod sursa (job #3234741) | Cod sursa (job #3168517)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("cautbin.in");
ofstream fout("cautbin.out");
int a[100001];
int cb0(int st, int dr, int n)
{
int mij;
while(st<=dr)
{
mij=(st+dr)/2;
if(n>=a[mij])
st=mij+1;
else dr=mij-1;
}
mij=(st+dr)/2;
if(a[mij]>n) mij--;
if(a[mij]==n) return mij;
return -1;
}
int cb1(int st, int dr, int n)
{
int mij;
while(st<=dr)
{
mij=(st+dr)/2;
if(n>=a[mij])
st=mij+1;
else dr=mij;
}
mij=(st+dr)/2;
if(n<a[mij]) mij--;
return mij;
}
int cb2(int st, int dr, int n)
{
int mij;
while(st<=dr)
{
mij=(st+dr)/2;
if(n>a[mij])
st=mij+1;
else dr=mij;
}
mij=(st+dr)/2;
if(n>a[mij]) mij++;
return mij;
}
int main()
{
int m,n,i, pb, nr;
fin>>n;
for(i=1;i<=n;i++)
fin>>a[i];
fin>>m;
for(i=1;i<=m;i++)
{
fin>>pb>>nr;
if(pb==0)
fout<<cb0(1,n,nr)<<"\n";
if(pb==1)
fout<<cb1(1,n,nr)<<"\n";
if(pb==2)
fout<<cb2(1,n,nr)<<"\n";
}
return 0;
}