Pagini recente » Cod sursa (job #3146858) | Cod sursa (job #2793316) | Cod sursa (job #2763368) | Cod sursa (job #316804) | Cod sursa (job #2924392)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("cautbin.in");
ofstream fout("cautbin.out");
int cb(int v[], int n, int x) {
int l=1, r=n, mid, sol=-1;
while (l<=r) {
mid = l+(r-l)/2;
if (v[mid]==x) {
sol = mid;
break;
}
else if (v[mid] > x) r = mid-1;
else if (v[mid] < x) l = mid+1;
}
return sol;
}
int q0 (int v[], int n, int x) {
int l=1, r=n, mid, sol = -1, p=1;
while (l<=r) {
mid = l+(r-l)/2;
if (v[mid] > x)
r = mid-1;
if (v[mid] < x)
l = mid+1;
if (x== v[mid]) {
sol = mid;
l=mid+1;
}
}
return sol;
}
int q1 (int v[], int n, int x) {
int l=1, r=n, mid, sol = -1, p=1;
while (l<=r) {
mid = l+(r-l)/2;
if (v[mid] > x)
r = mid-1;
if (v[mid] <= x) {
sol=mid;
l = mid+1;
}
}
return sol;
}
int q2 (int v[], int n, int x) {
int l=1, r=n, mid, sol = -1, p=1;
while (l<=r) {
mid = l+(r-l)/2;
if (v[mid] >= x) {
sol = mid;
r = mid-1;
}
if (v[mid] < x)
l = mid+1;
}
return sol;
}
int main (){
int v[101], n, x;
fin>>n;
for(int i=1; i<=n; i++)
fin>>v[i];
int r;
int m; fin>>m;
for(int i=1; i<=m; i++) {
fin>>r;
fin>>x;
if (r==0)
fout<< q0 (v,n,x)<<'\n';
else if (r==1)
fout<< q1 (v,n,x)<<'\n';
else if (r==2)
fout<< q2 (v,n,x)<<'\n';
}
fin.close();
fout.close();
return 0;
}