Cod sursa(job #1074658)
Utilizator | Data | 7 ianuarie 2014 20:28:19 | |
---|---|---|---|
Problema | Cautare binara | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 1.48 kb |
#include <iostream>
#include <fstream>
using namespace std;
int v[100100];
int main() {
ifstream in("cautbin.in");
ofstream out("cautbin.out");
int n,m,i,j,x,y;
in>>n;
for(i=1;i<=n;i++)
{
in>>v[i];
}
in>>m;
for(i=1;i<=m;i++)
{
in>>x>>y;
int st=1;
int dr=n;
int ans=-1;
int ok=0;
while(st<=dr && ok==0)
{
int mij=(st+dr)/2;
if(x==1)
{
if(v[mij]<=y)
{
ans=mij;
st=mij+1;
}
else
{
dr=mij-1;
}
}
else if(x==2)
{
if(v[mij]>=y)
{
ans=mij;
dr=mij-1;
}
else
{
st=mij+1;
}
}
else
{
for(j=n;j>=1 && ok==0;j--)
{
if(v[j]==y)
{
ok=1;
ans=j;
}
}
}
}
out<<ans<<endl;
}
return 0;
}