Pagini recente » Cod sursa (job #1369205) | Cod sursa (job #2286600) | Cod sursa (job #2508009) | Cod sursa (job #2135616) | Cod sursa (job #2384010)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("cautbin.in");
ofstream fout("cautbin.out");
int main()
{
int n;
fin>>n;
int v[n+1];
for (int i=1;i<=n;++i)
fin>>v[i];
int m;
fin>>m;
for (int i=1;i<=m;++i)
{
int ce,x,st,dr,y,mij;
bool g;
fin>>ce>>x;
switch(ce)
{
case 0:
st=1;
dr=n;
g=false;
while (!g && st<=dr)
{
mij=(dr+st)/2;
if (x==v[mij] && x!=v[mij+1]) g=true,y=mij;
else if (x>=v[mij]) st=mij+1;
else dr=mij-1;
}
if (g) fout<<y<<'\n';
else fout<<-1<<'\n';
break;
case 1:
st=1;
dr=n;
g=false;
while (!g && st<=dr)
{
mij=(dr+st)/2;
if (x>=v[mij] && x<v[mij+1]) y=mij,g=true;
else if (x>=v[mij]) st=mij+1;
else dr=mij-1;
}
fout<<y<<'\n';
break;
case 2:
st=1;
dr=n;
g=false;
while (!g && st<=dr)
{
mij=(dr+st)/2;
if (x<=v[mij] && x>v[mij-1]) g=true,y=mij;
else if (x>v[mij]) st=mij+1;
else dr=mij-1;
}
fout<<y<<'\n';
break;
}
}
}