Pagini recente » Cod sursa (job #1067670) | Cod sursa (job #1489947) | Cod sursa (job #992153) | Cod sursa (job #2072901) | Cod sursa (job #1262550)
# include <fstream>
using namespace std;
ifstream in("cautbin.in");
ofstream out("cautbin.out");
int v[100001];
int bin0(int p,int u,int val)
{
int m;
while (p<=u)
{
m=(p+u)/2;
if (v[m]>val) u=m-1;
else p=m+1;
}
m=(p+u)/2;
if (v[m]>val) m--;
if (v[m]==val) return m;
return -1;
}
int bin1(int p,int u,int val)
{
int m;
while (p<u)
{
m=(p+u)/2;
if (v[m]>val) u=m;
else p=m+1;
}
m=(p+u)/2;
if (v[m]>val) m--;
return m;
}
int bin2(int p,int u,int val)
{
int m;
while (p<u)
{
m=(p+u)/2;
if (v[m]>=val) u=m;
else p=m+1;
}
m=(p+u)/2;
if (v[m]<val) m++;
return m;
}
int main()
{
int n,i,m,x,y;
in>>n;
for (i=1;i<=n;i++) in>>v[i];
in>>m;
for (i=1;i<=m;i++)
{
in>>x>>y;
if (x==0) out<<bin0(1,n,y)<<'\n';
else
if (x==1) out<<bin1(1,n,y)<<'\n';
else
out<<bin2(1,n,y)<<'\n';
}
return 0;
}