Pagini recente » Cod sursa (job #953114) | Cod sursa (job #2482675) | Cod sursa (job #1879511) | Cod sursa (job #860552) | Cod sursa (job #2709759)
///de folosit mij = st + (dr - st) / 2 pt evitat erori
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("cautbin.in");
ofstream fout("cautbin.out");
int caut0(int a[], int n, int val)
{
int poz = -1;
int st = 0, dr = n - 1;
while(st <= dr)
{
int mij = st + (dr - st) / 2;
if(a[mij] == val)
poz = mij, st = mij + 1;
else if(a[mij] > val)
dr = mij - 1;
else
st = mij + 1;
}
if(poz == -1)
return poz;
return poz + 1;
}
int caut1(int a[], int n, int val)
{
int poz = -1;
int st = 0, dr = n - 1;
while(st <= dr)
{
int mij = st + (dr - st) / 2;
if(a[mij] == val)
poz = mij, st = mij + 1;
else if(a[mij] > val)
dr = mij - 1;
else
st = mij + 1;
}
if(poz != -1)
return poz + 1;
return dr + 1;
}
int caut2(int a[], int n, int val)
{
int poz = -1;
int st = 0, dr = n - 1;
while(st <= dr)
{
int mij = st + (dr - st) / 2;
if(a[mij] == val)
poz = mij, dr = mij - 1;
else if(a[mij] > val)
dr = mij - 1;
else
st = mij + 1;
}
if(poz != -1)
return poz + 1;
return st + 1;
}
int n, m;
int a[100003];
int main()
{
fin >> n;
for(int i = 0; i < n; ++i)
fin >> a[i];
fin >> m;
for(int intr = 0; intr < m; ++intr)
{
int intrebare, val;
fin >> intrebare >> val;
if(intrebare == 0)
fout << caut0(a, n, val) << '\n';
else if(intrebare == 1)
fout << caut1(a, n, val) << '\n';
else
fout << caut2(a, n, val) << '\n';
}
return 0;
}