Pagini recente » Cod sursa (job #22243) | Cod sursa (job #43214) | Cod sursa (job #1591989) | Cod sursa (job #2520887) | Cod sursa (job #1339895)
#include <fstream>
using namespace std;
ifstream fin("cautbin.in");
ofstream fout("cautbin.out");
int n,m,i,x,tip,v[100010];
void cautb0(int x);
void cautb1(int x);
void cautb2(int x);
int main()
{
fin>>n;
for(i=1;i<=n;++i)
fin>>v[i];
fin>>m;
for(i=1;i<=m;++i)
{
fin>>tip>>x;
if(tip==0)
{
cautb0(x);
}
else
{
if(tip==1)
{
cautb1(x);
}
else
{
cautb2(x);
}
}
}
return 0;
}
void cautb0(int x)
{
int ls=1;
int ld=n;
int pos=-1;
int mij;
while(ls<=ld)
{
mij=(ls+ld)/2;
if(v[mij]==x)
pos=max(mij,pos);
if(v[mij]<=x)
{
ls=mij+1;
}
else
{
ld=mij-1;
}
}
fout<<pos<<'\n';
}
void cautb1(int x)
{
int ls=1;
int ld=n;
int pos=-1;
int mij;
while(ls<=ld)
{
mij=(ls+ld)/2;
if(v[mij]<=x)
pos=max(mij,pos);
if(v[mij]<=x)
{
ls=mij+1;
}
else
{
ld=mij-1;
}
}
fout<<pos<<'\n';
}
void cautb2(int x)
{
int ls=1;
int ld=n;
int pos=n;
int mij;
while(ls<=ld)
{
mij=(ls+ld)/2;
if(v[mij]>=x)
pos=min(mij,pos);
if(v[mij]>=x)
{
ld=mij-1;
}
else
{
ls=mij+1;
}
}
fout<<pos<<'\n';
}