Pagini recente » Cod sursa (job #1852631) | Cod sursa (job #280086) | Cod sursa (job #1903542) | Cod sursa (job #1077153) | Cod sursa (job #2151135)
#include <fstream>
using namespace std;
ifstream fin("cautbin.in");
ofstream fout("cautbin.out");
int n, m, i, j, v[100005], x, tip;
int caut0(int st, int dr, int x)
{
int m;
while(st<=dr)
{
m=(st+dr)/2;
if(v[m]<x)
st=m+1;
else if(v[m]>x)
dr=m-1;
else
{
if(v[m+1]==x&&m+1<=n)
st=m+1;
else return m;
}
}
return -1;
}
int caut1(int st, int dr, int x)
{
int m;
while(st<=dr)
{
m=(st+dr)/2;
if(v[m]<x)
st=m+1;
else if(v[m]>x)
dr=m-1;
else
{
if(v[m+1]==x&&m+1<=n)
st=m+1;
else return m;
}
if((v[m]<x&&v[m+1]>x)||(v[m]<x&&m+1>n))
return m;
}
return -1;
}
int caut2(int st, int dr, int x)
{
int m;
while(st<=dr)
{
m=(st+dr)/2;
if(v[m]<x)
st=m+1;
else if(v[m]>x)
dr=m-1;
else
{
if(v[m-1]==x&&m-1>=0)
dr=m-1;
else return m;
}
if((v[m]>x&&v[m-1]<x)||(v[m]>x&&m-1<1))
return m;
}
return -1;
}
int main()
{
fin>>n;
for(i=1;i<=n;i++)
fin>>v[i];
fin>>m;
for(i=1;i<=m;i++)
{
fin>>tip>>x;
if(tip==0)
{
fout<<caut0(1,n,x)<<'\n';
}
if(tip==1)
{
fout<<caut1(1,n,x)<<'\n';
}
if(tip==2)
{
fout<<caut2(1,n,x)<<'\n';
}
}
return 0;
}