Cod sursa(job #1927755)
| Utilizator | Data | 15 martie 2017 15:32:31 | |
|---|---|---|---|
| Problema | Cautare binara | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 1.01 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("cautbin.in"); ofstream g("cautbin.out");
int n,i,a[100001],m,c,x;
int cautbin(int x) {
int st=1,dr=n,mij,last=-1;
while(st<=dr) {
mij=(st+dr)/2;
if(x==a[mij]) {
if (c==0) {
last=mij;
st=mij+1;
}
if (c==1) {
last=mij;
st=mij+1;
}
if (c==2) {
last=mij;
dr=mij-1;
}
}
if(x<a[mij]) {
dr=mij-1;
if (c==2) {
last=mij;
}
}
if(x>a[mij]) {
st=mij+1;
if (c==1) {
last=mij;
}
}
}
return last;
}
int main() {
f>>n;
for(i=1;i<=n;++i) {
f>>a[i];
}
f>>m;
for(i=1;i<=m;++i) {
f>>c>>x;
g<<cautbin(x)<<'\n';
}
return 0;
}
