Cod sursa(job #1325793)
| Utilizator | Data | 24 ianuarie 2015 12:56:37 | |
|---|---|---|---|
| Problema | Cautare binara | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 1.35 kb |
#include <fstream>
using namespace std;
ifstream fin("date.in");
ofstream fout("date.out");
int main()
{
//info arena cautare binara.
//infoarena.ro/problema/cautbin
//vezi si www.infoarena/blog/cautare-binara;
int n,s[100],i,m,x,a,inc,sf,k;
fin>>n;
for(i=1;i<=n;i++)
fin>>s[i];
fin>>k;
for(i=1;i<=k;i++)
{fin>>a>>x;
if(a==0){
inc=1;
sf=n;
while(inc<=sf)
{m=(inc+sf)/2;
if(s[m]<=x)
inc=m+1;
else
sf=m-1;
if(s[m]>x)
m--;}
if(s[m]==x)
fout<<m<<"\n";
else
fout<<-1<<"\n";}
if(a==1){
inc=1;
sf=n;
while(inc<=sf){
m=(inc+sf)/2;
if(s[m]<=x)
inc=m+1;
else
sf=m-1;
if(s[m]>x)
--m;}
if(s[m]<=x)
fout<<m<<"\n";}
if(a==2){
inc=1;
sf=n;
while(inc<=sf){
m=(inc+sf)/2;
if(s[m]<x)
inc=m+1;
else
sf=m-1;
if(s[m]<x)
++m;}
fout<<m<<"\n";}}
return 0;
}
