Pagini recente » Cod sursa (job #2892679) | Cod sursa (job #3201624) | Cod sursa (job #1021279) | Cod sursa (job #1379891) | Cod sursa (job #1962735)
#include <iostream>
#include <fstream>
using namespace std;
int a[100010];
int main()
{
ifstream fin ("cautbin.in");
ofstream fout ("cautbin.out");
long long li, lf, mij;
int n, m, x, y, i, j;
fin >> n;
for (i=1; i<=n; i++)
fin >> a[i];
fin >> m;
for (i=1; i<=m; i++)
{
fin >> x >> y;
li=1;
lf=n;
mij=(li+lf)/2;
if (x==0)
{
while (li<=lf && y!=a[mij])
{
if (y<a[mij])
lf=mij-1;
else
li=mij+1;
mij=(li+lf)/2;
}
j=mij;
while (a[j]==a[mij])
j++;
mij=j-1;
if (a[mij]!=y)
mij=-1;
}
else if (x==1)
{
while (li<=lf && y!=a[mij])
{
if (y<a[mij])
lf=mij-1;
else
li=mij+1;
mij=(li+lf)/2;
}
j=mij;
while (a[j]<=a[mij] && j!=n+1)
j++;
mij=j-1;
}
else
{
while (li<=lf && y!=a[mij])
{
if (y<a[mij])
lf=mij-1;
else
li=mij+1;
mij=(li+lf)/2;
}
j=mij;
while (a[j]>=a[mij])
j--;
if (a[mij]==y)
mij=j+1;
else
mij=j+2;
}
fout << mij << "\n";
}
return 0;
}