Pagini recente » Cod sursa (job #3286352) | Cod sursa (job #256631) | Cod sursa (job #3033392) | Cod sursa (job #37117) | Cod sursa (job #2207707)
#include <fstream>
#include <iostream>
using namespace std;
ifstream f("cautbin.in");
ofstream g("cautbin.out");
int n, v[100005], x, cer, q;
int cautbin0(int nr)
{
int st=1, dr=n, mid;
if(v[dr]==nr) return dr;
while(st<=dr)
{
mid=(st+dr)/2;
if(v[mid]<=nr)
st=mid+1;
else
dr=mid-1;
}
mid=(st+dr)/2;
if(v[mid]==nr)
return mid;
return -1;
}
int cautbin1(int nr)
{
int st=1, dr=n, mid;
while(st<dr)
{
mid=(st+dr)/2;
if(v[mid]<=nr)
st=mid+1;
else dr=mid;
}
mid=(st+dr)/2;
if(v[mid]>nr)
mid--;
return mid;
}
int cautbin2(int nr)
{
int st=1, dr=n, mid;
if(v[st]==nr) return dr;
while(st<dr)
{
mid=(st+dr)/2;
if(v[mid]<nr)
st=mid+1;
else dr=mid;
}
mid=(st+dr)/2;
if(v[mid]<nr)
mid++;
return mid;
}
int main()
{
f>>n;
for(int i=1; i<=n; i++)
f>>v[i];
f>>q;
for(int i=1; i<=q; i++)
{f>>cer>>x;
if(cer==0)
g<<cautbin0(x)<<'\n';
else if(cer==1)
g<<cautbin1(x)<<'\n';
else if(cer==2)
g<<cautbin2(x)<<'\n';
}
return 0;
}