Pagini recente » Cod sursa (job #605682) | Cod sursa (job #1524579) | Cod sursa (job #594396) | Cod sursa (job #1806419) | Cod sursa (job #944509)
Cod sursa(job #944509)
#include <fstream>
using namespace std;
ifstream f("cautbin.in");
ofstream g("cautbin.out");
int a,n,m,i,j,mij,r,b,mic,mare;
unsigned long s[100001];
int main()
{
f>>n;
for(i=1;i<=n;i++)
f>>s[i];
f>>m;
for (i=1;i<=m;i++)
{
f>>a;
f>>b;
r=-1;
mic=1;
mare=n;
if (a<1)
{
while(mic<=mare)
{
mij=(mic+mare)/2;
if (s[mij]==b)
{
r=mij;
mic=mij+1;
}
if(s[mij]<b)
mic=mij+1;
if (s[mij]>b)
mare=mij-1;
}
}
else if (a<2)
{
while(mic<=mare)
{
mij=(mic+mare)/2;
if(s[mij]<=b)
r=mij,mic=mij+1;
else
mare=mij-1;
}
}
else
{
while(mic<=mare)
{
mij=(mic+mare)/2;
if(s[mij]>=b)
r=mij,mare=mij-1;
else
mic=mij+1;
}
}
g<<r<<'\n';
}
f.close();
g.close();
return 0;
}