Pagini recente » Cod sursa (job #2582998) | Cod sursa (job #1779123) | Cod sursa (job #929582) | Cod sursa (job #752578) | Cod sursa (job #2193632)
#include <fstream>
using namespace std;
ifstream in("cautbin.in");
ofstream out("cautbin.out");
int v[100001], n;
int caut0(int x) {
int p = 1, u = n, poz = -1;
while(p <= u) {
int m = (p+u) / 2;
if(x == v[m])
poz = m;
if(x >= v[m])
p = m+1;
else
u = m-1;
}
return poz;
}
int caut1(int x) {
int p = 1, u = n, poz = -1;
while(p <= u) {
int m = (p+u) / 2;
if(x >= v[m]) {
poz = m;
p = m+1;
} else
u = m-1;
}
return poz;
}
int caut2(int x) {
int p = 1, u = n, poz = -1;
while(p <= u) {
int m = (p+u) / 2;
if(x <= v[m]) {
poz = m;
u = m-1;
} else
p = m+1;
}
return poz;
}
int main()
{
int m;
in >> n;
for(int i = 1; i <= n; i++)
in >> v[i];
in >> m;
while(m--) {
int t, x;
in >> t >> x;
switch(t) {
case 0:
out << caut0(x) << '\n';
break;
case 1:
out << caut1(x) << '\n';
break;
case 2:
out << caut2(x) << '\n';
//break;
}
}
return 0;
}