Pagini recente » Cod sursa (job #1638409) | Cod sursa (job #1516738) | Cod sursa (job #2198325) | Cod sursa (job #1523350) | Cod sursa (job #1348010)
#include <fstream>
using namespace std;
ifstream f("cautbin.in");
ofstream g("cautbin.out");
long n,m, a[100001],x,q;
void caut0(int x, int p, int u)
{
int m;
if(p<=u)
{
m=(u+p)/2;
if(a[m]==x)
{
q=m;
caut0(x,m+1,u);
}
if(q==0)
{
if(a[m]<x) caut0(x,m+1,u);
else caut0(x,p,m);
}
}
}
void caut1(int x, int p, int u)
{
int m;
if(p<=u)
{
m=(p+u)/2;
if(a[m]<=x)
{
q=m;
caut1(x,m+1,u);
}
if(q==0)
{
caut1(x,p,m);
}
}
}
void caut2(int x, int p, int u)
{
int m;
if(p<=u)
{
m=(p+u)/2;
if(a[m]>=x)
{
q=m;
caut2(x,p,m);
}
if(q==0)
{
caut2(x,m+1,u);
}
}
}
void cit()
{
f>>n;
int i,p;
for(i=1; i<=n; i++)
f>>a[i];
f>>m;
for(i=1; i<=m; i++)
{
f>>p>>x;
q=0;
switch(p)
{
case 0:
{
caut0(x,1,n);
if(q) g<<q<<'\n';
else g<<-1<<'\n';
}
break;
case 1:
{
caut1(x,1,n);
g<<q<<'\n';
}
break;
case 2:
{
caut2(x,1,n);
g<<q<<'\n';
}
break;
}
}
}
int main()
{
cit();
return 0;
}