Pagini recente » Cod sursa (job #1178969) | Cod sursa (job #2538717) | Cod sursa (job #146777) | Cod sursa (job #2823695) | Cod sursa (job #2618524)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("cautbin.in");
ofstream g("cautbin.out");
int v[1000];
int Cautare0(int st, int dr, int k)
{
int mij;
while(st<=dr)
{
mij=(st+dr)/2;
if(v[mij]<=k)
st=mij+1;
else
dr=mij-1;
}
mij=(st+dr)/2;
if(v[mij]>k)
mij--;
if(v[mij]==k)
return mij;
return -1;
}
int Cautare1(int st, int dr, int k)
{
int mij;
while(st<dr)
{
mij=(st+dr)/2;
if(v[mij]<=k)
st=mij+1;
else
dr=mij;
}
mij=(st+dr)/2;
if (v[mij]>k)
--mij;
return mij;
}
int Cautare2(int st, int dr, int k)
{
int mij;
while (st<dr)
{
mij=(st+dr)/2;
if(v[mij]<k)
st=mij+1;
else
dr=mij;
}
mij=(st+dr)/2;
if(v[mij]<k)
++mij;
return mij;
}
int n,i,op,nr,m;
int main()
{
f>>n;
for(i=1; i<=n; i++)
f>>v[i];
f>>m;
while(m--)
{
f>>op>>nr;
if(op==0)
g<<Cautare0(1,n,nr)<<endl;
if(op==1)
g<<Cautare1(1,n,nr)<<endl;
if(op==2)
g<<Cautare2(1,n,nr)<<endl;
}
return 0;
}