Pagini recente » Cod sursa (job #817541) | Cod sursa (job #34667) | Cod sursa (job #756003) | Cod sursa (job #3130460) | Cod sursa (job #2782826)
#include <fstream>
using namespace std;
int v[100001], n, k, p1, p2;
ifstream fin ("cautbin.in");
ofstream fout ("cautbin.out");
int CautareBinara0(int x) {
int poz=-1;
int st=1;
int dr=n;
while (st<=dr) {
int mij=(st+dr)/2;
if (v[mij]==x) {
poz=mij;
st=mij+1;
}
else dr=mij-1;
}
return poz;
}
int CautareBinara1 (int x) {
int poz=-1;
int st=1;
int dr=n;
while (st <= dr)
{
int mij = (st + dr) / 2;
if (x > v[mij]) dr = mij - 1;
else
{
poz = mij;
st = mij + 1;
}
}
return poz;
}
int CautareBinara2 (int x) {
int poz=-1;
int st=1;
int dr=n;
while (st<=dr) {
int mij=(st+dr)/2;
if (x>=v[mij]) {
if (v[mij]>=x) {
poz=mij;
dr=mij-1;
}
else st=mij+1;
}
return poz;
}
int main()
{
fin>>n;
for (int i=1; i<=n; i++) fin>>v[i];
fin>>k;
while (k) {
fin>>p1>>p2;
if (p1==0) fout<<CautareBinara0(p2)<<'\n';
else if (p1==1) fout<<CautareBinara1(p2)<<'\n';
else if (p1==2) fout<<CautareBinara2(p2)<<'\n';
k--;
}
return 0;
}