Pagini recente » Cod sursa (job #2319878) | Cod sursa (job #2507451) | Cod sursa (job #1368706) | Cod sursa (job #2649873) | Cod sursa (job #2652043)
#include <bits/stdc++.h>
using namespace std;
ifstream fin ("cautbin.in");
ofstream fout("cautbin.out");
int n,v[100002];
int caut0 (int x)
{
int st=1,dr=n,last=-1;
while (st<=dr)
{
int mij=(st+dr)/2;
if (v[mij]==x)
{
last=mij;
st=mij+1;
}
else
if (v[mij]<x)
st=mij+1;
else dr=mij-1;
}
return last;
}
int caut1 (int x)
{
int st=1,dr=n,last=n;
while (st<=dr)
{
int mij=(st+dr)/2;
if (v[mij]<=x)
{
last=mij;
st=mij+1;
}
else dr=mij-1;
}
return last;
}
int caut2 (int x)
{
int st=1,dr=n,first=1;
while (st<=dr)
{
int mij=(st+dr)/2;
if (v[mij]>=x)
{
first=mij;
dr=mij-1;
}
else st=mij+1;
}
return first;
}
int main()
{
int i,q,tip,x;
fin>>n;
for (i=1;i<=n;i++)
fin>>v[i];
fin>>q;
while (q--)
{
fin>>tip>>x;
if (tip==1)
fout<<caut1(x);
else if (tip==2)
fout<< caut2(x);
else fout<< caut0(x);
fout<<'\n';
}
}