Pagini recente » Cod sursa (job #3215047) | Cod sursa (job #2964566) | Cod sursa (job #2267279) | Cod sursa (job #1259262) | Cod sursa (job #2360030)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("cautbin.in");
ofstream fout("cautbin.out");
int n, m, v[100005];
int binar0(int x)
{
int st=1, dr=n, mid, poz=0;
while(st<=dr)
{
mid=(st+dr)/2;
if(v[mid]==x)
return mid;
if(v[mid]<x)
st=mid+1;
else
dr=mid-1;
}
return -1;
}
int binar1(int x)
{
int st=1, dr=n, mid;
while(st<=dr)
{
mid=(st+dr)/2;
if(v[mid]>x)
dr=mid-1;
else
st=mid+1;
}
return st-1;
}
int binar2(int x)
{
int st=1, dr=n, mid;
while(st<=dr)
{
mid=(st+dr)/2;
if(v[mid]<x)
st=mid+1;
else
dr=mid-1;
}
return st;
}
void Rezolva()
{
int aux1, aux2;
fin>>n;
for(int i=1; i<=n; i++)
fin>>v[i];
fin>>m;
for(int i=1; i<=m; i++)
{
fin>>aux1>>aux2;
if(aux1==0)
binar0(aux2);
else if(aux1==1)
binar1(aux2);
else
binar2(aux2);
}
}
int main()
{
Rezolva();
return 0;
}