Pagini recente » Cod sursa (job #1863584) | Cod sursa (job #403835) | Cod sursa (job #2226536) | Cod sursa (job #134412) | Cod sursa (job #1853552)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("cautbin.in");
ofstream fout("cautbin.out");
const int Nmax=100000+5;
long long a[Nmax];
int n,m;
int cautbin0(long long key,int p,int u)
{
int m;
while(p<=u)
{
m=(p+u)/2;
if(a[m]<=key)p=m+1;
else u=m-1;
}
m=(p+u)/2;
if(a[m]>key)
m--;
if(a[m]==key)return m;
return -1;
}
int cautbin1(long long key,int p,int u)
{
int m;
while(p<u)
{
m=(p+u)/2;
if(a[m]<=key)p=m+1;
else u=m;
}
m=(p+u)/2;
if(a[m]>key)
m--;
return m;
}
int cautbin2(long long key,int p,int u)
{
int m;
while(p<u)
{
m=(p+u)/2;
if(a[m]<key)p=m+1;
else u=m;
}
m=(p+u)/2;
if(a[m]<key)
m++;
return m;
}
int main()
{
long long x,y;
fin>>n;
for(int i=1;i<=n;++i)fin>>a[i];
fin>>m;
for(int i=1;i<=m;++i)
{
fin>>x>>y;
if(x==0)
fout<<cautbin0(y,1,n)<<'\n';
else
{
if(x==1)
fout<<cautbin1(y,1,n)<<'\n';
else fout<<cautbin2(y,1,n);
}
}
return 0;
}