Cod sursa(job #2376430)
Utilizator | Papadia Mortala dacianoua | Data | 8 martie 2019 15:35:15 |
---|---|---|---|
Problema | Cautare binara | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 1.25 kb |
#include <fstream>
#define nmax 100000
using namespace std;
ifstream fin("cautbin.in");
ofstream fout("cautbin.out");
int n,m,v[nmax+5],op,st,dr,mid,x;
int main()
{
fin>>n;
for(int i=1;i<=n;i++)
fin>>v[i];
fin>>m;
while(m--)
{
fin>>op>>x;
st=1,dr=n;
switch(op)
{
case 0:
while(st<=dr)
{
mid=(dr-st)/2+st;
if(v[mid]<=x)
st=mid+1;
else
dr=mid-1;
}
if(v[dr]==x)
fout<<dr<<"\n";
else
fout<<-1<<"\n";
break;
case 1:
while(st<=dr)
{
mid=(dr-st)/2+st;
if(v[mid]<=x)
st=mid+1;
else
dr=mid-1;
}
fout<<dr<<"\n";
break;
case 2:
while(st<=dr)
{
mid=(dr-st)/2+st;
if(v[mid]<x)
st=mid+1;
else
dr=mid-1;
}
fout<<st<<"\n";
break;
}
}
return 0;
}