Cod sursa(job #1248378)
Utilizator | Vali Deaconu Vali_Deaconu | Data | 25 octombrie 2014 00:15:04 |
---|---|---|---|
Problema | Cautare binara | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 1.46 kb |
#include <iostream>
#include <fstream>
#define VMAX 100001
using namespace std;
ifstream fin ("cautbin.in");
ofstream fout ("cautbin.out");
int st, dr, mid, n, m, q, i; // CAUTARE BINARA
int unsigned v[VMAX], a;
int main()
{
fin >> n;
for (i=1; i<=n; i++)
fin >> v[i];
fin >> m;
for (i=1; i<=m; i++) {
fin >> q >> a;
if ( q == 0 ) {
st = v[1]; dr = v[n];
while ( st <= dr ) {
mid = st+(dr-st)/2;
if (a == v[mid]) {
st = mid + 1;
}
else {
dr = mid - 1;
}
}
if ( v[dr] == a )
fout << dr << '\n';
else
fout << "-1" << '\n';
}
if ( q == 1 ) {
st = v[1]; dr = v[n];
while ( st <= dr ) {
mid = st+(dr-st)/2;
if (a >= v[mid])
st = mid + 1;
else
dr = mid - 1;
}
fout << dr << '\n';
}
if ( q == 2 ) {
st = v[1]; dr = v[n];
while ( st <= dr ) {
mid = st+(dr-st)/2;
if (a <= v[mid])
dr = mid - 1;
else
st = mid + 1;
}
fout << st << '\n';
}
}
return 0;
}