Pagini recente » Cod sursa (job #1952874) | Cod sursa (job #2960295) | Cod sursa (job #1597743) | Cod sursa (job #2390064) | Cod sursa (job #1596648)
#include <fstream>
using namespace std;
ifstream in("cautbin.in");
ofstream out("cautbin.out");
const int nmax=100002;
int v[nmax];
int cautbin0(int x,int &n)//0
{
int st=1,dr=n,mij;
while(st<=dr)
{
mij=(st+dr)/2;
if(v[mij]==x)st=mij+1;
else dr=mij-1;
}
if(v[dr]==x) return dr;
else return -1;
}
int cautbin1(int x,int &n)//1
{
int st=1,dr=n,mij;
while(st<=dr)
{
mij=(st+dr)/2;
if(v[mij]<=x)st=mij+1;
else dr=mij-1;
}
return dr;
}
int cautbin2(int x,int &n)//2
{
int st=1,dr=n,mij;
while(st<=dr)
{
mij=(st+dr)/2;
if(v[mij]>=x)dr=mij-1;
else st=mij+1;
}
return st;
}
int main()
{
ios_base::sync_with_stdio(false);
int n,m,c,r,x;
in>>n;
for(int i=1;i<=n;i++)
in>>v[i];
in>>m;
for(int i=1;i<=m;i++)
{
in>>c>>x;
if(c==0)r=cautbin0(x,n);
else if(c==1)r=cautbin1(x,n);
else if(c==2)r=cautbin2(x,n);
out<<r<<"\n";
}
return 0;
}