Pagini recente » Cod sursa (job #2501935) | Cod sursa (job #1983431) | Cod sursa (job #805593) | Istoria paginii runda/lista1 | Cod sursa (job #1321038)
#include <fstream>
using namespace std;
ifstream fin("cautbin.in");
ofstream fout("cautbin.out");
int v[100010],N,x,i,M,m1;
int caut0(int val)
{
int i, step;
for (step = 1; step < N; step <<= 1);
for (i = 0; step; step >>= 1)
if (i + step < N && v[i + step] <= val)
i += step;
//while (v[i]==val) i++;
if (v[i]==val) return i+1;
else return -1;
}
int caut1(int val)
{
int i, step;
for (step = 1; step < N; step <<= 1);
for (i = 0; step; step >>= 1)
if (i + step < N && v[i + step] <= val)
i += step;
return i+1;
}
int caut2(int val)
{
int i, step;
for (step = 1; step < N; step <<= 1);
for (i = 1; step; step >>= 1)
if (i + step < N && v[i + step] < val)
i += step;
return i+1;
}
int main()
{
fin>>N;
for (i=0;i<N;i++)
fin>>v[i];
fin>>M;
for (i=0;i<M;i++)
{
fin>>m1; fin>>x;
if (m1==0) fout<<caut0(x)<<endl;
if (m1==1) fout<<caut1(x)<<endl;
if (m1==2) fout<<caut2(x)<<endl;
}
return 0;
}