Pagini recente » Cod sursa (job #2581771) | Cod sursa (job #1403898) | Cod sursa (job #1980455) | Cod sursa (job #1003954) | Cod sursa (job #2581580)
#include <bits/stdc++.h>
#define MAX 100000
using namespace std;
int n;
unsigned long long v[MAX];
int bin0(unsigned long long x)
{
unsigned long long p;
for(p = 1; (p << 1) <= n; p <<= 1);
int poz = 0;
for(; p; p >>= 1)
if(poz + p <= n && v[poz + p] <= x)
{
poz += p;
if(v[poz] == x)return poz;
}
return -1;
}
int bin1(long long x)
{
unsigned long long p;
for(p = 1; (p << 1) <= n; p <<= 1);
int poz = 0;
for(; p; p >>= 1)
if(poz + p <= n && v[poz + p] <= x)
{
poz += p;
if(v[poz] == x)return poz;
}
return poz;
}
int bin2(long long x)
{
int st = 1, dr = n, gasit = -1;
while(st <= dr)
{
int mij = (st + dr) >> 1;
if(v[mij] >= x)
{
gasit = mij;
dr = mij - 1;
}
else st = mij + 1;
}
return gasit;
}
int main()
{
ifstream fin("cautbin.in");
ofstream fout("cautbin.out");
ios::sync_with_stdio(false);
fin.tie(0);
fout.tie(0);
srand(time(NULL));
fin >> n;
for(int i = 1; i <= n; i++)
fin >> v[i];
int m;
fin >> m;
for(int i = 1; i <= m; i++)
{
int c;
unsigned long long a;
fin >> c >> a;
if(c == 0)fout << bin0(a) << '\n';
else if(c == 1)fout << bin1(a) << '\n';
else fout << bin2(a) << '\n';
}
fin.close();
fout.close();
return 0;
}