Pagini recente » Cod sursa (job #1106767) | Cod sursa (job #2829479)
#include <bits/stdc++.h>
using namespace std;
int a[100005];
ifstream fin("cautbin.in");
ofstream fout("cautbin.out");
int cautare_binara0(int n, int x)
{
int st,dr,mij;
st=1;
dr=n;
while (st<=dr)
{
mij=(st+dr)/2;
if (x<a[mij])
dr=mij-1;
if (x>=a[mij])
st=mij+1;
}
if (a[dr]==x)
return dr;
return -1;
}
int cautare_binara1(int n, int x)
{
int st,dr,mij;
st=1;
dr=n;
while (st<=dr)
{
mij=(st+dr)/2;
if (x<a[mij])
dr=mij-1;
if (x>=a[mij])
st=mij+1;
}
return dr;
}
int cautare_binara2(int n, int x)
{
int st,dr,mij;
st=1;
dr=n;
while (st<=dr)
{
mij=(st+dr)/2;
if (x<=a[mij])
dr=mij-1;
if (x>a[mij])
st=mij+1;
}
return st;
}
int n,m,k,x;
int main()
{
fin>>n;
for (int i=1; i<=n; i++) fin>>a[i];
fin>>m;
for (int i=1; i<=m; i++)
{
fin>>k>>x;
if (k==0)
{
fout<<cautare_binara0(n,x)<<"\n";
}
else if (k==1)
{
fout<<cautare_binara1(n,x)<<"\n";
}
else if (k==2)
{
fout<<cautare_binara2(n,x)<<"\n";
}
}
}