Pagini recente » Cod sursa (job #1368884) | Cod sursa (job #3267057) | Cod sursa (job #777122) | Cod sursa (job #3169226) | Cod sursa (job #2172539)
#include <bits/stdc++.h>
using namespace std;
ifstream f("cautbin.in");
ofstream g("cautbin.out");
int n,m,a[100002];
int caut0(int x, int st, int dr)
{
int m;
if(st<=dr)
{
m=(st+dr)/2;
if(a[m]>x)
return caut0(x,st,m-1);
else
return caut0(x,m+1,dr);
}
m=(st+dr)/2;
if(a[m]>x) --m;
if(a[m]==x)
return m;
return -1;
}
int caut1(int x, int st, int dr)
{
int m;
if(st<=dr)
{
m=(st+dr)/2;
if(a[m]>x)
return caut1(x,st,m-1);
else
return caut1(x,m+1,dr);
}
m=(st+dr)/2;
if(a[m]>x) --m;
return m;
}
int caut2(int x, int st, int dr)
{
int m;
if(st<=dr)
{
m=(st+dr)/2;
if(a[m]>=x)
return caut2(x,st,m-1);
else
return caut2(x,m+1,dr);
}
m=(st+dr)/2;
if(a[m]<x) ++m;
return m;
}
int main()
{
f>>n;
for(int i=1;i<=n;i++)
f>>a[i];
f>>m;
for(int i=1;i<=m;i++)
{
int x,v;
f>>v>>x;
if(v==0)
g<<caut0(x,1,n)<<'\n';
else
if(v==1)
g<<caut1(x,1,n)<<'\n';
else
g<<caut2(x,1,n)<<'\n';
}
return 0;
}