Pagini recente » Borderou de evaluare (job #575087) | Cod sursa (job #887143) | Cod sursa (job #3242627) | Cod sursa (job #3255734) | Cod sursa (job #2653837)
#include <fstream>
using namespace std;
ifstream fin("cautbin.in");
ofstream fout("cautbin.out");
int n, a[100050];
int cautbin1(int x)
{
int st=1,dr=n,m,p=-1;
while(st<=dr)
{
m=(st+dr)/2;
if(x>a[m])st=m+1;
else if(x<a[m])dr=m-1;
else {p=m;st=m+1;}
}
if(p)return p;
return -1;
}
int cautbin2(int x)
{
int dr=n,st=1,m,p;
while(st<=dr)
{
m=(st+dr)/2;
if(x>=a[m]){p=m;st=m+1;}
else dr=m-1;
}
return p;
}
int cautbin3(int x)
{
int dr=n,st=1,m,p;
while(st<=dr)
{
m=(st+dr)/2;
if(a[m]>=x){p=m;dr=m-1;}
else st=m+1;
}
return p;
}
int main()
{
int s,i,x,y;
fin>>n;
for(i=1;i<=n;i++)
fin>>a[i];
fin>>s;
while(s)
{
fin>>y>>x;
if(y==0)fout<<cautbin1(x)<<endl;
if(y==1)fout<<cautbin2(x)<<endl;
if(y==2)fout<<cautbin3(x)<<endl;
s--;
}
return 0;
}