Pagini recente » Cod sursa (job #2962866) | Cod sursa (job #2448247) | Cod sursa (job #2835849) | Cod sursa (job #2712976) | Cod sursa (job #1128518)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("cautbin.in");
ofstream g("cautbin.out");
int n,k,x,i,m,v[100002];
int caut0(int x)
{
int st,dr,mij,sol;
st=1;
dr=n;
sol=-1;
while(st<=dr)
{
mij=(st+dr)/2;
if(v[mij]==x){sol=mij;st=mij+1;}if(v[mij]>x)dr=mij-1;else st=mij+1;
}
return sol;
}
int caut1(int x)
{
int st,dr,mij,sol;
st=1;
dr=n;
sol=-1;
while(st<=dr)
{
mij=(st+dr)/2;
if(v[mij]<=x){sol=mij;st=mij+1;}
else dr=mij-1;
}
return sol;
}
int caut2(int x)
{
int st,dr,mij,sol;
st=1;
dr=n;
sol=-1;
while(st<=dr)
{
mij=(st+dr)/2;
if(v[mij]>=x){sol=mij;dr=mij-1;}
else st=mij+1;
}
return sol;
}
int main()
{
f>>n;
for(i=1;i<=n;i++)
f>>v[i];
f>>m;
for(i=1;i<=m;i++)
{
f>>k>>x;
if (k==0)g<<caut0(x)<<"\n";
if (k==1)g<<caut1(x)<<"\n";
if (k==2)g<<caut2(x)<<"\n";
}
return 0;
}