Pagini recente » Cod sursa (job #1792806) | Cod sursa (job #1221479) | Cod sursa (job #433831) | Cod sursa (job #1301089) | Cod sursa (job #2538548)
#include <iostream>
#include <fstream>
using namespace std;
int main()
{
int n,i,v[999],m,x,ok,p,q,mij,y;
ifstream f("cautbin.in");
ofstream g("cautbin.out");
f>>n;
for(i=1;i<=n;i++)
f>>v[i];
f>>m;
while(m>0)
{
f>>y;
f>>x;
p=1;
q=n;
ok=0;
while(p<=q&&ok==0)
{
mij=(p+q)/2;
if(v[mij]==x)
{
ok=1;
}
else
if(x<v[mij])
{
q=mij-1;
}
else
p=mij+1;
while(v[mij]==v[mij+1])
{
mij=mij+1;
}
}
if(ok==0&&y==0)
g<<"-1"<<'\n';
if(ok==1&&y==0)
g<<mij<<'\n';
while(v[mij]==v[mij+1]&&y==1)
{
mij=mij+1;
}
if(y==1)
g<<mij<<'\n';
while(v[mij]==v[mij-1]&&y==2)
{
mij=mij-1;
}
if(y==2)
g<<mij<<'\n';
m=m-1;
}
return 0;
}