Pagini recente » Cod sursa (job #2956751) | Cod sursa (job #1615945) | Istoria paginii runda/test_hor1 | Istoria paginii utilizator/archangel | Cod sursa (job #2073087)
#include <iostream>
#include<fstream>
using namespace std;
int v[100000];
const int L = 16;
int main()
{
ifstream f("cautbin.in");
ofstream o("cautbin.out");
int n,m,r,pas,i,k,L,x;
f >> n;
for(i=1; i<=n; i++)
{
f >>v[i];
}
f >> m;
for(i=1; i<=m; i++)
{
f >> k >> x;
pas=1<<L;
r=0;
if (k == 0 || k == 1)
{
while(pas!=0)
{
if(r+pas<=n && v[r+pas]<=x)
{
r+=pas;
}
pas/=2;
}
if(k == 0 && v[r]!=x)
{
r=-1;
}
}
else
{
while(pas!=0)
{
if(r+pas<=n && v[r+pas]<x)
{
r+=pas;
}
pas/=2;
}
r++;
}
o << r << "\n";
}
}