Pagini recente » Cod sursa (job #639080) | Cod sursa (job #1105329) | Cod sursa (job #2172960) | Cod sursa (job #1240747) | Cod sursa (job #2360066)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("cautbin.in");
ofstream fout("cautbin.out");
int n, m, v[100005];
int binar0(int st, int dr, int x)
{
int mid, poz=0;
while(st<=dr)
{
mid=(st+dr)/2;
if(v[mid]==x)
{
poz=mid;
break;
}
else
if(v[mid]<x)
st=mid+1;
else
dr=mid-1;
}
while(v[++mid]==x)
poz=mid;
if(poz==0)
poz=-1;
return poz;
}
int binar1(int st, int dr, int x)
{
int mid, poz=0;
while(st<=dr)
{
mid=(st+dr)/2;
if(v[mid]==x)
{
poz=mid;
break;
}
else
if(v[mid]<x)
st=mid+1;
else
dr=mid-1;
}
while(v[++mid]==x)
poz=mid;
return poz;
}
int binar2(int st, int dr, int x)
{
int mid, poz=0;
while(st<=dr)
{
mid=(st+dr)/2;
if(v[mid]==x)
{
poz=mid;
break;
}
else
if(v[mid]<x)
st=mid+1;
else
dr=mid-1;
}
while(v[--mid]==x)
poz=mid;
return poz;
}
void rezolva()
{
int x1, x2;
fin>>n;
for(int i=1; i<=n; i++)
fin>>v[i];
fin>>m;
for(int i=1; i<=m; i++)
{
fin>>x1>>x2;
switch(x1)
{
case 0: fout<<binar0(1, n, x2)<<endl;
break;
case 1: fout<<binar1(1, n, x2)<<endl;
break;
case 2: fout<<binar2(1, n, x2)<<endl;
break;
}
}
}
int main()
{
rezolva();
return 0;
}