Pagini recente » Cod sursa (job #2899857) | Cod sursa (job #2508360) | Cod sursa (job #392782) | Cod sursa (job #525984) | Cod sursa (job #1918616)
#include <fstream>
using namespace std;
ifstream f("cautbin.in");
ofstream g("cautbin.out");
int n, i, t, x, v[100001], m, u, p;
int main()
{
f >> n;
for(i=1;i<=n;i++)
f >> v[i];
f >> m;
for(i=1;i<=m;i++){
f>>t>>x;
if(t==0)
{
p=1;
u=n;
while(p<=u)
{
m=(p+u)/2;
if(x<v[m]) u=m-1;
else p=m+1;
}
if(v[u]!=x) g << -1 << '\n';
else g << u << '\n';
}
else if(t==1)
{
p=1;
u=n;
while(p<=u)
{
m=(p+u)/2;
if(x<v[m]) u=m-1;
else p=m+1;
}
g<<u<<'\n';
}
else
{
p=1;
u=n;
while(p<=u)
{
m=(p+u)/2;
if(x<=v[m]) u=m-1;
else p=m+1;
}
g<<p<<'\n';
}
}
return 0;
}