Cod sursa(job #2290679)
Utilizator | Data | 26 noiembrie 2018 20:27:54 | |
---|---|---|---|
Problema | Cautare binara | Scor | 60 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 1.65 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("cautbin.in");
ofstream fout("cautbin.out");
int n,v[100001],k,x,m;
int main()
{
fin >> n;
for (int i=1;i<=n;i++)
fin >> v[i];
fin >> m;
for (int i=1;i<=m;i++)
{
fin >> x >> k;
if (x==0)
{
int st=1,dr=n,r,mid;
while (st<=dr)
{
mid=(st+dr)/2;
if (v[mid]>k)
{
dr=mid-1;
r=mid;
}
else
{
st=mid+1;
}
}
if (v[r-1]==k)
fout << r-1 <<"\n";
else
fout << -1 <<"\n";
}
if (x==1)
{
int st=1,dr=n,r,mid;
while (st<=dr)
{
mid=(st+dr)/2;
if (v[mid]>k)
{
r=mid;
dr=mid-1;
}
else
{
st=mid+1;
}
}
fout << r-1 <<"\n";
}
if (x==2)
{
int st=1,dr=n,mid,r;
while (st<=dr)
{
mid=(st+dr)/2;
if (v[mid]>=k)
{
r=mid;
dr=mid-1;
}
else
{
st=mid+1;
}
}
fout << r <<"\n";
}
}
return 0;
}