Pagini recente » Cod sursa (job #505361) | Monitorul de evaluare | Cod sursa (job #1717934) | Cod sursa (job #1955452) | Cod sursa (job #1417987)
#include<iostream>
#include<fstream>
using namespace std;
ifstream f("cautbin.in");
ofstream g("cautbin.out");
int a[101];
int binarytype0(int low, int high, int x)
{
int middle;
if(x<a[low]) return -1;
while(low<high)
{
middle=(low+high+1)/2;
if(x<a[middle]) high=middle-1;
if(x>=a[middle]) low=middle;
}
return low;
}
int binarytype1(int low, int high, int x)
{
int middle;
if(x==a[low]) return low;
while(low<high)
{
middle=(low+high+1)/2;
if(x<a[middle]) high=middle-1;
if(x>=a[middle]) low=middle;
}
return low;
}
int binarytype2(int low, int high, int x)
{
int middle;
if(x==a[high]) return high;
while(low<high)
{
middle=(low+high)/2;
if(x<=a[middle]) high=middle;
if(x>a[middle]) low=middle+1;
}
return high;
}
int main()
{
int n, i, m, type, x;
f>>n;
for(i=1; i<=n; i++)
f>>a[i];
f>>m;
while(m!=0)
{
f>>type>>x;
if(type==0) g<<binarytype0(1, n, x)<<'\n';
if(type==1) g<<binarytype1(1, n, x)<<'\n';
if(type==2) g<<binarytype2(1, n, x)<<'\n';
m--;
}
return 0;
}