Pagini recente » Cod sursa (job #1811105) | Cod sursa (job #1329534) | Cod sursa (job #3036720) | Cod sursa (job #886415) | Cod sursa (job #2055081)
#include <fstream>
#include <iostream>
using namespace std;
ifstream fin("cautbin.in");
ofstream fout("cautbin.out");
const int nm=100005;
int n,m,v[nm],a,b;
int bs0(int x)
{
int st=1,dr=n,med;
while(st<dr)
{
med=(st+dr)/2;
if(v[med]==x)
{
if(v[med+1]!=x)
return med;
st=med+1;
continue;
}
if(x<v[med])
dr=med-1;
else
st=med+1;
}
if(v[st]==x)
return st;
return -1;
}
int bs1(int x)
{
int st=1,dr=n,med;
while(st<dr)
{
med=(st+dr)/2;
if(v[med]==x)
{
if(v[med+1]!=x)
return med;
st=med+1;
continue;
}
if(v[med]<x)
st=med+1;
else
dr=med-1;
}
if(v[st]==x)
return st;
else
return st-1;
}
int bs2(int x)
{
int st=1,dr=n,med;
while(st<dr)
{
med=(st+dr)/2;
if(v[med]==x)
{
if(v[med-1]!=x)
return med;
dr=med-1;
continue;
}
if(v[med]>x)
dr=med-1;
else
st=med+1;
}
return st;
}
int main()
{
fin>>n;
for(int i=1;i<=n;i++)
fin>>v[i];
fin>>m;
for(int i=1;i<=m;i++)
{
fin>>a>>b;
if(a==0)fout<<bs0(b)<<"\n";
if(a==1)fout<<bs1(b)<<"\n";
if(a==2)fout<<bs2(b)<<"\n";
}
return 0;
}