Cod sursa(job #1755048)
Utilizator | Data | 9 septembrie 2016 12:03:26 | |
---|---|---|---|
Problema | Cautare binara | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.73 kb |
#include <fstream>
using namespace std;
int step,N,val,V[100],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(j=1; j<=t; j++)
{
f>>type>>val;
for (step = 1; step < N; step <<= 1);
if(type==0 || type==1)
{
for (i = 0; step; step >>= 1)
if (i + step <= N && V[i + step] <= val)
i += step;
g<<i<<'\n';
}
else
{
for (i = 0; step; step >>= 1)
if (i + step <= N && V[i + step] < val)
i += step;
g<<i+1<<'\n';
}
}
return 0;
}