Pagini recente » Cod sursa (job #1599776) | Cod sursa (job #1233388) | Cod sursa (job #3279612) | Cod sursa (job #1627697) | Cod sursa (job #1918579)
#include <fstream>
using namespace std;
ifstream f("cautbin.in");
ofstream g("cautbin.out");
int n, i, t, x, v[100001], m, u, p;
int main()
{
f >> n;
for(i=1;i<=n;i++)
f >> v[i];
f >> m;
for(i=1;i<=m;i++){
f >> t >> x;
if(t==0){
p = 1; u = n;
while (p <= u) {
m = (p + u) / 2;
if (v[m]>x)
u = m - 1;
else
p = m + 1;
}
if(v[u]!=x) g << -1 << '\n';
else g << u << '\n';
}
else if(t==1){
p = 1; u = n;
while (p <= u){
m = (p + u) / 2;
if (v[m]>x)
u = m - 1;
else
p = m + 1;
}
g << u << '\n';
}
else{
p = 1; u = n;
while (p <= u) {
m = (p + u) / 2;
if (v[m] >= x)
u = m - 1;
else
p = m + 1;
}
g << p << '\n';
}
}
return 0;
}