Pagini recente » Cod sursa (job #2656309) | Cod sursa (job #1561832) | Cod sursa (job #2101824) | Diferente pentru problema/findmin intre reviziile 2 si 1 | Cod sursa (job #2755084)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("cautbin.in");
ofstream fout("cautbin.out");
int a[100002];
void cautarebinara(int n,int m)
{
fin>>n;
for(int i=0;i<n;i++)
fin>>a[i];
fin>>m;
int x;
int c;
for(int j=0;j<m;j++)
{
fin>>c;
fin>>x;
int st,dr,mij;
int p=-1;
if(c==0)
{
st=0;
dr=n-1;
while(st<=dr)
{
mij=(st+dr)/2;
if(x==a[mij])
{
p=mij;
st=mij+1;
}
else
if(x>a[mij])
st=mij+1;
else
dr=mij-1;
}
fout<<p<<"\n";
}
p=-1;
if(c==1)
{
st=0;
dr=n-1;
while(st<=dr)
{
mij=(st+dr)/2;
if(x>=a[mij])
{
p=mij;
st=mij+1;
}
if(x<a[mij])
dr=mij-1;
}
fout<<p<<"\n";
}
p=-1;
if(c==2)
{
st=0;
dr=n-1;
while(st<=dr)
{
mij=(st+dr)/2;
if(x<=a[mij])
{
p=mij;
dr=mij-1;
}
if(x>a[mij])
st=mij+1;
}
fout<<p<<"\n";
}
}
}
int main()
{
int n,m;
cautarebinara(n,m);
return 0;
}