Pagini recente » Cod sursa (job #2701533) | Cod sursa (job #1286711) | Cod sursa (job #2774785) | Cod sursa (job #454837) | Cod sursa (job #1380485)
#include <iostream>
#include <fstream>
using namespace std;
int v[100001],op,y,n,m;
ofstream fout("cautbin.out");
int cautareBinara0(int x)
{
int st=1,dr=n;
int poz=-1;
while(st<=dr)
{
m=(dr-st)/2+st;
if(v[m]==x)
{
poz=m;
st=m+1;
}
else if(v[m]<x)
{
st=m+1;
}
else if(v[m]>x)
{
dr=m-1;
}
}
return poz;
}
int cautareBinara1(int x)
{
int st=1,dr=n;
int poz=-1;
while(st<=dr)
{
m=(dr-st)/2+st;
if(v[m]<=x)
{
poz=m;
st=m+1;
}
else
{
dr=m-1;
}
}
return poz;
}
int cautareBinara2(int x)
{
int st=1,dr=n;
int poz=-1;
while(st<=dr)
{
m=(dr-st)/2+st;
if(v[m]>=x)
{
poz=m;
dr=m-1;
}
else
{
st=m+1;
}
}
return poz;
}
int main()
{
ifstream fin("cautbin.in");
fin>>n;
for(int i=1;i<=n;++i)
fin>>v[i];
fin>>m;
for(int i=1;i<=m;++i)
{
fin>>op>>y;
if(op==0)
{
fout<<cautareBinara0(y)<<"\n";
continue;
}
if(op==1)
{
fout<<cautareBinara1(y)<<"\n";
continue;
}
if(op==2)
{
fout<<cautareBinara2(y)<<"\n";
continue;
}
}
return 0;
}