Pagini recente » Cod sursa (job #2708577) | Cod sursa (job #2197574) | Cod sursa (job #1002676) | Cod sursa (job #1090885) | Cod sursa (job #793854)
Cod sursa(job #793854)
#include <cstdio>
#define N 100000
using namespace std;
int n;
int m;
int a[N];
int funcB(int y)
{
int st = 0;
int dr = n-1;
int mij = (st+dr)/2;
while(st < dr)
{
if(y == a[st])
{
while(a[st+1] == y)
st++;
return st + 1;
}
else
if(y > a[st])
{
st= mij;
}
else
{
if(y < a[mij])
{
dr = mij;
}
}
mij = (st+dr)/2;
}
return st;
}
int funcA(int y)
{
int st = 0;
int dr = n-1;
int mij = (st+dr)/2;
while(st < dr)
{
if(y == a[st])
{
while(a[st+1] == y)
st++;
return st + 1;
}
else
if(y > a[st])
{
st= mij;
}
else
{
if(y < a[mij])
{
dr = mij;
}
}
mij = (st+dr)/2;
}
return -1;
}
int funcC(int y)
{
int st = 0;
int dr = n-1;
int mij = (st+dr)/2;
while(st < dr)
{
if(y == a[st])
{
while(a[st-1] == y)
st--;
return st + 1;
}
else
if(y > a[st])
{
st= mij;
}
else
{
if(y < a[mij])
{
dr = mij;
}
}
mij = (st+dr)/2;
}
return st + 1;
}
int main()
{
freopen("cautbin.in","r",stdin);
freopen("cautbin.out","w",stdout);
scanf("%d",&n);
for(int i = 0 ; i < n ; i++)
{
scanf("%d",&a[i]);
}
scanf("%d",&m);
for(int i = 0 ; i < m ; i++)
{
int x,y;
scanf("%d %d",&x,&y);
if(x == 0)
{
printf("%d\n",funcA(y));
}
else
if(x == 1)
{
printf("%d\n",funcB(y));
}
else
if(x == 2)
{
printf("%d\n",funcC(y));
}
}
return 0;
}