Pagini recente » Cod sursa (job #1067252) | Cod sursa (job #1661328) | Cod sursa (job #1357861) | Cod sursa (job #973955) | Cod sursa (job #1509916)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("cautbin.in");
ofstream g("cautbin.out");
int n,m,v[100001];
int bin0(int x)
{
int d=n,s=1,mij,poz=-1;
while(s<=d)
{
mij=(s+d)/2;
if(x>v[mij])
{
s=mij+1;
}
else if(x<v[mij])
{
d=mij-1;
}
else if(x==v[mij])
{
poz=mij;
s=mij+1;
}
}
return poz;
}
int bin1(int x)
{
int d=n,s=1,mij,poz=0;
while(s<=d)
{
mij=(s+d)/2;
if(x>=v[mij])
{
s=mij+1;
poz=mij;
}
else if(x<v[mij])
{
d=mij-1;
}
}
return poz;
}
int bin2(int x)
{
int d=n,s=1,mij,poz=0;
while(s<=d)
{
mij=(s+d)/2;
if(x>v[mij])
{
s=mij+1;
}
else if(x<=v[mij])
{
d=mij-1;
poz=mij;
}
}
return poz;
}
int main()
{
int a,b;
f>>n;
for(int i=1;i<=n;i++)f>>v[i];
f>>m;
for(int i=1;i<=m;i++)
{
f>>a>>b;
switch(a)
{
case 0: g<<bin0(b)<<"\n";
break;
case 1: g<<bin1(b)<<"\n";
break;
case 2: g<<bin2(b)<<"\n";
break;
}
}
return 0;
}