Pagini recente » Cod sursa (job #1673723) | Cod sursa (job #1890496) | Cod sursa (job #1989297) | Cod sursa (job #2862101) | Cod sursa (job #1717349)
#include <iostream>
#include <fstream>
#include <cstring>
#include <cstdio>
using namespace std;
ifstream in("cautbin.in");
//ofstream out("cautbin.out");
const int maxn = 100005;
const int max_size = 100005;
char txt[max_size];
int v[maxn];
char T[25];
int logn;
int n;
inline int cautbin_0(int x)
{
int i, pas;
for (pas = 1; pas < n; pas <<= 1);
for (i = 0; pas; pas >>= 1)
if (i + pas <= n && v[i + pas] <= x)
i += pas;
return i;
}
inline int cautbin_2(int x)
{
int st = 1;
int dr = n;
int ret = -1;
while(st <= dr)
{
int mij = st + (dr - st) / 2;
if(x <= v[mij])
{
ret = mij;
dr = mij - 1;
}
else
st = mij + 1;
}
return ret;
}
int poz = max_size - 1;
FILE *fin;
void parsare(int &nr)
{
nr = 0;
while(!isdigit(txt[poz]))
{
if(++poz == max_size)
{
fread(txt, 1, max_size, fin);
poz = 0;
}
}
while(isdigit(txt[poz]))
{
nr = nr * 10 + txt[poz] - '0';
if (++poz == max_size)
{
fread(txt, 1, max_size, fin);
poz = 0;
}
}
}
int main()
{
fin = fopen("cautbin.in", "r");
freopen("cautbin.in", "r", stdin);
freopen("cautbin.out", "w", stdout);
parsare(n);
for(int i = 1; i <= n; i++)
parsare(v[i]);
int m;
parsare(m);
gets(T);
gets(T);
gets(T);
for(int i = 1; i <= m; i++)
{
int x = 0;
int y = 0;
gets(T);
x = T[0] - '0';
int sz = strlen(T);
for(int i = 2; i < sz; i++)
y = y * 10 + T[i] - '0';
if(x == 0 || x == 1)
{
int sol = cautbin_0(y);
if(x == 0 && v[sol] != y)
printf("-1");
else
printf("%d", sol);
}
else
printf("%d", cautbin_2(y));
printf("\n");
}
return 0;
}