Pagini recente » Cod sursa (job #63477) | Cod sursa (job #878971) | Cod sursa (job #2620127) | Cod sursa (job #3213933) | Cod sursa (job #2476275)
#include <fstream>
#include <iostream>
using namespace std;
ifstream fin("cautbin.in");
ofstream fout("cautbin.out");
int v[100000];
int cb (int p, int u, int key) {
int m;
while (p <= u) {
m = (p + u) / 2;
if (v[m] <= key)
p = m + 1;
else
u = m - 1;
}
m = (p + u) / 2;
if (v[m] > key) m --;
if (v[m] == key)
return m;
return -1;
}
int cb2 (int p, int u, int key) {
int m, n = u;
while (p < u){
m = (p + u) / 2;
if (v[m] <= key)
p = m + 1;
else
u = m;
}
m = (p + u) / 2;
if (v[m] > key)
-- m;
return m;
}
int cb3 (int p, int u, int key) {
int m;
while (p < u) {
m = (p + u) / 2;
if (v[m] < key)
p = m + 1;
else
u = m;
}
m = (p + u) / 2;
if (v[m] < key)
++ m;
return m;
}
int main()
{
int n,m,x,c;
fin>>n;
for(int i=1;i<=n;i++)
fin>>v[i];
fin>>m;
for(int i=0;i<m;i++)
{
fin>>c>>x;
switch(c)
{
case 0:
fout<<cb(1,n,x)<<"\n";
break;
case 1:
fout<<cb(1,n,x)<<"\n";
break;
case 2:
fout<<cb3(1,n,x)<<"\n";
break;
}
}
return 0;
}