Pagini recente » Cod sursa (job #1317468) | Cod sursa (job #1369313) | Cod sursa (job #2154640) | Cod sursa (job #2143516) | Cod sursa (job #1051760)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("cautbin.in");
ofstream g("cautbin.out");
int v[100005],n;
int op0(int x)
{
int st=1,dr=n,m;
while(st<dr)
{
m=(st+dr)/2;
if(v[m]<x)
st=m+1;
else
dr=m;
}
for(;st<n && v[st]==x;++st);
if(v[st]>x)
--st;
if(v[st]!=x)
return -1;
return st;
}
int op1(int x)
{
int st=1,dr=n,m;
while(st<dr)
{
m=(st+dr+1)/2;
if(v[m]>x)
dr=m-1;
else
st=m;
}
return st;
}
int op2(int x)
{
int st=1,dr=n,m;
while(st<dr)
{
m=(st+dr)/2;
if(v[m]<x)
st=m+1;
else
dr=m;
}
return st;
}
int main ()
{
int x,tip,m;
f>>n;
for(int i=1;i<=n;++i)
f>>v[i];
f>>m;
for(int j=1;j<=m;++j)
{
f>>tip>>x;
if(tip==0)
g<<op0(x);
if(tip==1)
g<<op1(x);
if(tip==2)
g<<op2(x);
}
return 0;
}