Cod sursa(job #1005498)
Utilizator | Data | 5 octombrie 2013 10:03:42 | |
---|---|---|---|
Problema | Cautare binara | Scor | 40 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 1.8 kb |
#include <fstream>
using namespace std;
int n,m,i,poz,q,nr,st,dr,v[100005];
bool ok,ok1;
int main()
{
ifstream f("cautbin.in");
ofstream g("cautbin.out");
f>>n;
for(i=1;i<=n;i++)
f>>v[i];
f>>m;
for(i=1;i<=m;i++)
{
f>>q;f>>nr;
st=1;dr=n;
ok=1;ok1=1;
while(ok)
{
if(st==dr-1)
{
if(v[st]==nr)
poz=st;
else
if(v[dr]==nr)
poz=dr;
else
{
ok1=0;poz=st;
}
ok=0;
}
else
if(nr>v[(dr+st)/2])
{
st=(dr+st)/2;
}
else
if(nr<v[(dr+st)/2])
{
dr=(dr+st)/2;
}
else
if(nr==v[(dr+st)/2])
{
poz=(dr+st)/2;
ok=0;
}
}
if(q==0)
{
if(ok1==0)
g<<"-1"<<"\n";
else
{
while(v[poz]==nr)
poz++;
g<<poz-1<<"\n";
}
}
else
if(q==1)
{
if(ok1==0)
g<<poz<<"\n";
else
{
while(v[poz]==nr)
poz++;
g<<poz-1<<"\n";
}
}
else
if(q==2)
{
if(ok1==0)
g<<poz+1<<"\n";
else
{
while(v[poz]==nr)
poz--;
g<<poz+1<<"\n";
}
}
}
f.close();g.close();
return 0;
}