Pagini recente » Cod sursa (job #1663919) | Cod sursa (job #1839049) | Cod sursa (job #3122032) | Cod sursa (job #1852947) | Cod sursa (job #1630948)
#include <fstream>
using namespace std;
int a[100001],n,m;
ifstream in ("cautbin.in");
ofstream out ("cautbin.out");
int CautBina1(int b)
{
int st=1,dr=n,m,poz;
poz=-1;
while(st<=dr)
{
m=(st+dr)/2 ;
if(a[m]==b)
poz=m;
if(a[m]<b)
st=m+1;
else dr=m-1;
}
while(a[poz]==b)
poz++;
return poz-1;
}
int CautBina2(int b)
{
int st=1,dr=n,m,poz;
poz=0;
while(st<=dr)
{
m=(st+dr)/2 ;
if(a[m]<=b)
{
poz=m;
st=m+1;
}
else dr=m-1;
}
return poz;
}
int CautBina3(int b)
{
int st=1,dr=n,m,poz;
poz=0;
while(st<=dr)
{
m= (st+dr)/2 ;
if(a[m]>=b)
{
poz=m;
dr=m-1;
}
else st=m+1;
}
return poz;
}
int main()
{
in>>n;
int i,cer,x;
for(i=1; i<=n; i++)
in>>a[i];
in>>m;
for(i=1; i<=m; i++)
{
in>>cer>>x;
if(cer==0)
out<<CautBina1(x)<<'\n';
if(cer==1)
out<<CautBina2(x)<<'\n';
if(cer==2)
out<<CautBina3(x)<<'\n';
}
return 0;
}