Pagini recente » Cod sursa (job #2174408) | Cod sursa (job #3166448) | Cod sursa (job #17583) | Cod sursa (job #1231253) | Cod sursa (job #1366557)
# include <fstream>
# include <algorithm>
# include <vector>
# include <queue>
# include <cstring>
# define LB(p) ((-p)&p)
# define NR 100005
# define mod 1999999973
using namespace std;
ifstream f("cautbin.in");
ofstream g("cautbin.out");
int i,j,n,m,x,tip;
int a[NR];
int cb (int x)
{
int ci=1, cs=n, mij;
while (ci<=cs)
{
mij=(ci+cs)/2;
if (x<a[mij]) cs=mij-1;
else ci=mij+1;
}
if (a[cs]==x) return cs;
else return -1;
}
int cb1 (int x)
{
int ci=1, cs=n, mij;
while (ci<=cs)
{
mij=(ci+cs)/2;
if (x<a[mij]) cs=mij-1;
else ci=mij+1;
}
return cs;
}
int cb2 (int x)
{
int ci=1, cs=n, mij;
while (ci<=cs)
{
mij=(ci+cs)/2;
if (x<a[mij]) cs=mij-1;
else ci=mij+1;
}
return cs+1;
}
int main ()
{
f>>n;
for (i=1; i<=n; ++i)
f>>a[i];
f>>m;
for (i=1; i<=m; ++i)
{
f>>tip>>x;
if (tip==0) g<<cb (x)<<"\n";
else if (tip==1) g<<cb1 (x)<<"\n";
else if (tip==2) g<<cb2 (x-1)<<"\n";
}
return 0;
}