Cod sursa(job #1301895)
Utilizator | Data | 26 decembrie 2014 14:34:28 | |
---|---|---|---|
Problema | Cautare binara | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 1.7 kb |
#include<fstream>
using namespace std;
int main()
{
ifstream f("cautbin.in");
ofstream g("cautbin.out");
long n,m,t[100001],i,x,a,b,k;
int p;
bool jo;
f>>n;
for(i=1;i<=n;i++)
f>>t[i];
f>>m;
for(i=1;i<=m;i++)
{
f>>p>>x;
if(p==0)
{
jo=0;
a=1;
b=n;
k=(a+b)/2;
while(a<=b)
{
if(t[k]>x)
{
b=k-1;
k=(a+b)/2;
}
else
{
a=k+1;
k=(a+b)/2;
}
}
if(t[k]==x)
g<<k<<"\n";
else g<<"-1\n";
}
else if(p==1)
{
jo=0;
a=1;
b=n;
k=(a+b)/2;
while(a<=b)
{
if(t[k]>x)
{
b=k-1;
k=(a+b)/2;
}
else
{
a=k+1;
k=(a+b)/2;
}
}
g<<k<<"\n";
}
else {
jo=0;
a=1;
b=n;
k=(a+b)/2;
while(a<=b)
{
if(t[k]>=x)
{
b=k-1;
k=(a+b)/2;
}
else
{
a=k+1;
k=(a+b)/2;
}
}
g<<k+1<<"\n";
}
}
f.close();
g.close();
return 0;
}