Mai intai trebuie sa te autentifici.
Cod sursa(job #1515967)
Utilizator | Data | 2 noiembrie 2015 15:46:15 | |
---|---|---|---|
Problema | Cautare binara | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 1.42 kb |
#include<iostream>
#include<fstream>
using namespace std;
ifstream fin("cautbin.in");
ofstream fout("cautbin.out");
double n;
int v[100001];
int test1(int v[],int st, int dr,int m){
int max = 1;
while (st <= dr){
int mij = (st + dr) / 2;
if (v[mij] == m){
max = mij;
st = mij + 1;
}
else if (v[mij] < m)st = mij + 1;
else dr = mij - 1;
}
if (max == 1)return -1;
return max;
}
int test2(int v[], int st, int dr, int m){
int max = 1;
while (st <= dr){
int mij = (st + dr) / 2;
if (v[mij] <= m){
max = mij;
st = mij + 1;
}
else dr = mij - 1;
}
return max;
}
int test3(int v[], int st, int dr, int m){
int max = 1;
while (st <= dr){
int mij = (st + dr) / 2;
if (v[mij] >= m){
max = mij;
dr = mij - 1;
}
else if (v[mij] < m)dr = mij + 1;
}
return max;
}
int main() {
int t, m, nr, test, p,i;
fin >> n;
for (i = 1; i <= n; i++)
fin >> v[i];
fin >> test;
for (i = 1; i <= test; i++){
fin >> t;
fin >> m;
if (t == 0)fout << test1(v, 1, n, m)<< "\n";
if (t == 1)fout << test2(v, 1, n, m)<< "\n";
if (t == 2)fout << test3(v, 1, n, m)<< "\n";
}
fin.close();
fout.close();
return 0;
}