Cod sursa(job #1673755)
Utilizator | Data | 4 aprilie 2016 09:14:25 | |
---|---|---|---|
Problema | Cautare binara | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 2.04 kb |
#include <fstream>
#include <iostream>
using namespace std;
int poz,v[100000],x,nr;
void bin(int l,int r,int opt)
{
if(l>r)
{
return;
}
int m;
m=(l+r)/2;
switch (opt)
{
case 0:
{
if(x<v[m])
{
bin(l,m-1,opt);
}
else if(x>v[m])
{
bin(m+1,r,opt);
}
else
{
if(poz<m)
poz=m;
bin(m+1,r,opt);
}
break;
}
case 1:
{
if(x<v[m])
{
bin(l,m-1,opt);
}
else
{
if(poz<m)
poz=m;
bin(m+1,r,opt);
}
break;
}
case 2:
{
if(x>v[m])
{
bin(m+1,r,opt);
}
else
{
if(poz>m)
poz=m;
bin(l,m-1,opt);
}
break;
}
}
}
int main()
{
ifstream in("cautbin.in");
ofstream out("cautbin.out");
int n,m;
in>>n;
int i;
for(i=0;i<n;i++)
{
in>>v[i];
}
in>>m;
for(i=0;i<m;i++)
{
in>>nr>>x;
if(nr==2)
poz=n-1;
else
poz=-1;
bin(0,n-1,nr);
out<<poz+1<<"\n";
}
return 0;
}