Cod sursa(job #1491880)
Utilizator | Data | 26 septembrie 2015 12:29:39 | |
---|---|---|---|
Problema | Cautare binara | Scor | 20 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 1.5 kb |
#include<fstream>
using namespace std;
int v[100001];
int main()
{
ifstream f("cautbin.in");
ofstream g("cautbin.out");
int n,m,st,dr,mij,x,ans=-1,ans1,i,a,ans2;
f>>n;
dr=n;
for(i=1;i<=n;++i)
f>>v[i];
f>>m;
for(i=1;i<=m;++i)
{
st=1;
dr=n;
f>>a>>x;
if(a==1)
{
while(st<=dr)
{
mij=(st+dr)/2;
if(v[mij]<=x)
{
ans1=mij;
st=mij+1;
}
else
dr=mij-1;
}
g<<ans1<<endl;
}
else if(a==0)
{
while(st<=dr)
{
mij=(st+dr)/2;
if(v[mij]==x)
{
ans=mij;
st=mij+1;
}
else if(v[mij]<x)
st=mij+1;
else
dr=mij-1;
}
g<<ans<<endl;
}
else if(a==2)
{
while(st<=dr)
{
mij=(st+dr)/2;
if(v[mij]>=x)
{
ans2=mij;
dr=mij-1;
}
else
st=mij+1;
}
g<<ans2<<endl;
}
}
}