Pagini recente » Cod sursa (job #2089791) | Cod sursa (job #2150535) | Cod sursa (job #738323) | Cod sursa (job #1093320) | Cod sursa (job #1396315)
#include <iostream>
#include <vector>
#include <cstdio>
#define TYPE_0 0
#define TYPE_1 1
#define TYPE_2 2
#define NOT_FOUND -1
int binary_search0(const std::vector<int>& V, int left, int right, int x)
{
int last = 0;
for (; left < right; ) {
int mid = left + (right - left) / 2;
if (V[mid] <= x) {
last = mid;
left = mid;
} else right = mid - 1;
}
if (V[last] == x) return last;
else return NOT_FOUND;
}
int binary_search1(const std::vector<int>& V, int left, int right, int x)
{
int last = 0;
for (; left < right; ) {
int mid = left + (right - left) / 2;
if (V[mid] <= x) {
last = mid;
left = mid;
} else right = mid - 1;
}
return last;
}
int binary_search2(const std::vector<int>& V, int left, int right, int x)
{
int last = 0;
for (; left < right; ) {
int mid = left + (right - left) / 2;
if (V[mid] >= x) {
last = mid;
right = mid;
} else left = mid + 1;
}
return last;
}
int main()
{
FILE *fdin = fopen("cautbin.in", "r");
FILE *fdout = fopen("cautbin.out", "w");
int N;
fscanf(fdin, "%d", &N);
std::vector<int> V;
int elem;
for (int i = 0; i < N; i++) {
fscanf(fdin, "%d", &elem);
V.push_back(elem);
}
int op_number;
fscanf(fdin, "%d", &op_number);
int op_type, x;
for (int operation = 1; operation <= op_number; operation++) {
fscanf(fdin, "%d%d", &op_type, &x);
switch(op_type) {
case TYPE_0 :
fprintf(fdout, "%d\n", binary_search0(V, 0, V.size(), x) + 1);
break;
case TYPE_1 :
fprintf(fdout, "%d\n", binary_search1(V, 0, V.size(), x) + 1);
break;
case TYPE_2 :
fprintf(fdout, "%d\n", binary_search2(V, 0, V.size(), x) + 1);
break;
default :
fprintf(fdout, "Don't give me stupid indexes\n");
}
}
fclose(fdin);
fclose(fdout);
return 0;
}