Pagini recente » Cod sursa (job #1804872) | Cod sursa (job #917524) | Cod sursa (job #279634) | Cod sursa (job #1489941) | Cod sursa (job #1596643)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin ("cautbin.in");
ofstream fout ("cautbin.out");
const int nmax = 100005;
int v[nmax], n;
int bs0(int val)
{
int st=1, dr=n, mij;
while(st<=dr)
{
mij=(st+dr)>>1;
if(v[mij]<=val) st=mij+1;
else dr=mij-1;
}
if(v[dr]==val) return dr;
return -1;
}
int bs1(int val)
{
int st=1, dr=n, mij;
while(st<=dr)
{
mij=(st+dr)>>1;
if(v[mij]<=val) st=mij+1;
else dr=mij-1;
}
return dr;
}
int bs2(int val)
{
int st=1, dr=n, mij;
while(st<=dr)
{
mij=(st+dr)>>1;
if(v[mij]<val) st=mij+1;
else dr=mij-1;
}
return st;
}
int main()
{
ios_base::sync_with_stdio(false);
int m, op, x, i;
fin >> n;
for(i=1; i<=n; i++)
fin >> v[i];
fin >> m;
for(i=1; i<=m; i++)
{
fin >> op >> x;
if(op==0) fout << bs0(x) << "\n";
else if(op==1) fout << bs1(x) << "\n";
else fout << bs2(x) << "\n";
}
fin.close();
fout.close();
return 0;
}