Pagini recente » Cod sursa (job #395693) | Cod sursa (job #1531000) | Cod sursa (job #1584411) | Cod sursa (job #3177838) | Cod sursa (job #1431455)
#include<fstream>
#define nmax 100006
using namespace std;
int n,m,intrebare,element,limita1,limita2,mij,poz,v[nmax];
int main()
{
ifstream f("cautbin.in");
ofstream g("cautbin.out");
f>>n;
for(int i=1;i<=n;i++)
f>>v[i];
f>>m;
for(int i=1;i<=m;i++)
{
f>>intrebare>>element;
limita1=0;
limita2=n+1;
if(intrebare==0)
{
while(limita1<limita2)
{
mij=(limita2+limita1)/2;
if(element>=v[mij])limita1=mij+1;
else limita2=mij-1;
}
mij=(limita2+limita1)/2;
if(v[mij]==element)g<<mij<<"\n";
else g<<"-1\n";
}
if(intrebare==1)
{
while(limita1<limita2)
{
mij=(limita2+limita1)/2;
if(element>=v[mij])limita1=mij+1;
else limita2=mij-1;
}
mij=(limita2+limita1)/2;
g<<mij<<"\n";
}
if(intrebare==2)
{
while(limita1<limita2)
{
mij=(limita2+limita1)/2;
if(element<=v[mij])limita2=mij-1;
else limita1=mij+1;
}
g<<limita2<<"\n";
}
}
return 0;
}