Cod sursa(job #1168734)
Utilizator | Data | 9 aprilie 2014 13:10:02 | |
---|---|---|---|
Problema | Cautare binara | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 1.4 kb |
#include <fstream>
using namespace std;
ifstream f("cautbin.in");
ofstream g("cautbin.out");
int a[100004],st,dr,mij,tipul,se,n,m,i,poz;
int main()
{
f>>n;
for(i=1; i<=n; i++)
f>>a[i];
f>>m;
for(i=1; i<=m; i++)
{
f>>tipul>>se;
st=1;
dr=n;
poz=-1;
if(tipul==0)
{
while(st<=dr)
{
mij=(st+dr)/2;
if(a[mij]<se)
st=mij+1;
else if(a[mij]>se)
dr=mij-1;
else
{
poz=mij;
st=mij+1;
}
}
g<<poz<<'\n';
}
else if(tipul==1)
{
while(st<=dr)
{
mij=(st+dr)/2;
if(a[mij]<=se)
{
st=mij+1;
poz=mij;
}
else dr=mij-1;
}
g<<poz<<'\n';
}
else if(tipul==2)
{
while(st<=dr)
{
mij=(st+dr)/2;
if(a[mij]<se)
st=mij+1;
else
{
poz=mij;
dr=mij-1;
}
}
g<<poz<<'\n';
}
}
return 0;
}