Pagini recente » Cod sursa (job #856503) | Cod sursa (job #233000) | Cod sursa (job #2862370) | Cod sursa (job #1812093) | Cod sursa (job #1755060)
#include <fstream>
using namespace std;
int step,N,val,V[100000],i,t,j,type;
ifstream f("cautbin.in");
ofstream g("cautbin.out");
int main()
{
f>>N;
for(i=1; i<=N; i++)
f>>V[i];
f>>t;
for (step = 1; step < N; step <<= 1);
for(j=1; j<=t; j++)
{
f>>type>>val;
if(type==0)
{
for (i = 0; step; step=step/2)
if (i + step <= N && V[i + step] <= val)
i += step;
if(V[i]==val)
g<<i<<'\n';
else g<<-1<<'\n';
}
else if(type==1)
{
for (i = 0; step; step >>= 1)
if (i + step <= N && V[i + step] <= val)
i += step;
g<<i<<'\n';
}
else if(type==2)
{
for (i = 0; step; step >>= 1)
if (i + step <= N && V[i + step] >=val)
i += step;
g<<i<<'\n';
}
}
return 0;
}