Pagini recente » Cod sursa (job #61892) | Cod sursa (job #2316697) | Cod sursa (job #544876) | Cod sursa (job #403385) | Cod sursa (job #1501196)
#include <fstream>
using namespace std;
ifstream f("cautbin.in");
ofstream g("cautbin.out");
int caut0(int a[], int n, int x)
{
int m=0, M=n-1, mid;
while(m<=M)
{
mid=(M+m)/2;
if(a[mid]<=x) m=mid+1;
else M=mid-1;
}
mid=(m+M)/2;
if(a[mid]>x) mid--;
if(a[mid]==x) return mid+1;
else return -1;
}
int caut1(int a[], int n, int x)
{
int m=0, M=n-1, mid;
while(m<M)
{
mid=(M+m)/2;
if(a[mid]<=x) m=mid+1;
else M=mid;
}
mid=(m+M)/2;
if(a[mid]>x) mid--;
return mid+1;
}
int caut2(int a[], int n, int x)
{
int m=0, M=n-1, mid;
while(m<M)
{
mid=(M+m)/2;
if(a[mid]>=x) M=mid;
else m=mid+1;
}
mid=(m+M)/2;
if(a[mid]<x) mid++;
return mid+1;
}
int main()
{
int n, q, i, a[100000], intrebare, ce;
f>>n;
for(i=0;i<n;++i) f>>a[i];
f>>q;
for(i=1; i<=q; ++i)
{
f>>intrebare>>ce;
if(intrebare==0) g<<caut0(a,n,ce)<<'\n';
else if(intrebare==1) g<<caut1(a,n,ce)<<'\n';
else g<<caut2(a,n,ce)<<'\n';
}
f.close();
g.close();
return 0;
}