Pagini recente » Cod sursa (job #143831) | Cod sursa (job #473757) | Cod sursa (job #2066680) | Cod sursa (job #1258853) | Cod sursa (job #1999352)
#include <bits/stdc++.h>
using namespace std;
ifstream f("cautbin.in");
ofstream g("cautbin.out");
int n,m,a[100001];
int cauta_0(int x)
{
int i=1,j=n,mid;
while(i<=j)
{
mid=(i+j)/2;
if(a[mid]<=x)
i=mid+1;
else
j=mid-1;
}
mid=(i+j)/2;
if(a[mid]>x) mid--;
if(a[mid]==x)
return mid;
else
return -1;
}
int cauta_1(int x)
{
int i=1,j=n,mid;
while(i<=j)
{
mid=(i+j)/2;
if(a[mid]<=x)
i=mid+1;
else
j=mid-1;
}
mid=(i+j)/2;
if(a[mid]>x) mid--;
return mid;
}
int cauta_2(int x)
{
int i=1,j=n,mid;
while(i<=j)
{
mid=(i+j)/2;
if(a[mid]<x)
i=mid+1;
else
j=mid-1;
}
mid=(i+j)/2;
if(a[mid]<x) mid++;
return mid;
}
int main()
{
f>>n;
for(int i=1;i<=n;++i)
f>>a[i];
f>>m;
for(int i=1;i<=m;++i)
{
int x,y;
f>>x>>y;
if(x==0)
g<<cauta_0(y)<<'\n';
else if(x==1)
g<<cauta_1(y)<<'\n';
else
g<<cauta_2(y)<<'\n';
}
}