Cod sursa(job #1720366)
Utilizator | Gigel Fronel Gigel-Frone | Data | 22 iunie 2016 11:27:01 |
---|---|---|---|
Problema | Cautare binara | Scor | 80 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 1.37 kb |
#include <fstream>
using namespace std;
int main()
{
ifstream f("cautbin.in");
ofstream g("cautbin.out");
int n;
f >> n;
int *v;
v=new int [n];
for(int i=1; i<=n; i++) f >> v[i];
int m;
f >> m;
for(int i=1; i<=m; i++)
{
int a, x;
f >> a >> x;
if(a==0)
{
int mid, lo=1, hi=n;
while(lo<=hi)
{
mid=lo+(hi-lo)/2;
if(v[mid]<=x) lo=mid+1;
else hi=mid-1;
}
mid=lo+(hi-lo)/2;
if(v[mid]>x) mid--;
if(v[mid]==x) g << mid << '\n';
else g << -1 << '\n';
}
if(a==1)
{
int mid, lo=1, hi=n;
while(lo<hi)
{
mid=lo+(hi-lo)/2;
if(v[mid]<=x)lo=mid+1;
else hi=mid;
}
mid=lo+(hi-lo)/2;
if(v[mid]>x) mid--;
g << mid << '\n';
}
if(a==2)
{
int mid, lo=1, hi=n;
while(lo<hi)
{
mid=lo+(hi-lo)/2;
if(v[mid]<x) lo=mid+1;
else hi=mid;
}
mid=lo+(hi-lo)/2;
if(v[mid]<x) mid++;
g << mid << '\n';
}
}
}