Pagini recente » Cod sursa (job #1188731) | Cod sursa (job #1696070) | Cod sursa (job #2591390) | Cod sursa (job #696350) | Cod sursa (job #2215084)
#include <fstream>
#include <vector>
#include <utility>
#include <algorithm>
using namespace std;
ifstream f("cautbin.in");
ofstream g("cautbin.out");
int n;
int cautare_binara(int a[100],int target,int s,int r)
{
int media;
while(s<=r)
{
media=(s+r)/2;
if(a[media]==target)
return media;
if(a[media]<target)
s=media+1;
if(a[media]>target)
r=media-1;
}
return -1;
}
int main()
{int i,j,m,a[100],x,y;
f>>n;
for(i=1;i<=n;i++)
f>>a[i];
f>>m;
for(i=1;i<=m;i++)
{
f>>y>>x;
int k=cautare_binara(a,x,1,n);
if(y==0)
{
if(k==-1)
g<<"-1"<<endl;
else
{
while(cautare_binara(a,x,k+1,n)!=-1 and a[k+1]==x)
k++;
g<<k<<endl;
}
}
if(y==1)
{
while(cautare_binara(a,x,k+1,n)!=-1 and a[k+1]<=x)
k++;
g<<k<<endl;
}
if(y==2)
{
while(cautare_binara(a,x,k-1,k)!=-1 and a[k-1]>=x)
k--;
g<<k<<endl;
}
}
return 0;
}