Pagini recente » Cod sursa (job #1997918) | Cod sursa (job #1363973) | Cod sursa (job #2890156) | Cod sursa (job #513818) | Cod sursa (job #704191)
Cod sursa(job #704191)
#include<cstdio>
using namespace std;
long long int n,m,v[100010],i,tip,x;
long long int rez0,rez1,rez2;
int cautbine0 (long long int a)
{
long long int mij=1,st=1,dr=n;
rez0=-1;
while (st<=dr){
mij=st+(dr-st)/2;
if (v[mij]==a){
while (v[mij]==a){
rez0=mij;
mij++;
}
return rez0;
}
else{
if (v[mij]>a)
dr=mij-1;
else
st=mij+1;
}
}
return -1;
}
int cautbine1(long long int a)
{
long long int st=1,dr=n,mij=1;
while (st<=dr){
mij=st+(dr-st)/2;
if (v[mij]==a){
while (v[mij]<=a){
rez1=mij;
mij++;
}
return rez1;
}
else {
if (v[mij]>a)
dr=mij-1;
else
st=mij+1;
}
}
return -1;
}
int cautbine2(long long a)
{
long long int st=1,dr=n,mij=1;
while (st<=dr){
mij=st+(dr-st)/2;
if (v[mij]==a){
while (v[mij]==a){
rez2=mij;
mij--;
}
return rez2;
}
else {
if (v[mij]>a)
dr=mij-1;
else
st=mij+1;
}
}
return -1;
}
int main()
{
freopen("cautbin.in","r",stdin);
freopen("cautbin.out","w",stdout);
scanf("%lld",&n);
for (i=1;i<=n;i++)
scanf("%lld",&v[i]);
scanf("%lld",&m);
for (i=1;i<=m;i++){
scanf ("%lld %lld",&tip,&x);
if (tip==0){
rez0=cautbine0(x);
printf("%lld\n",rez0);
}
if (tip==1){
rez1=cautbine1(x);
printf("%lld\n",rez1);
}
if (tip==2){
rez2=cautbine2(x);
printf("%lld\n",rez2);
}
}
return 0;
}