Pagini recente » Cod sursa (job #1059700) | Cod sursa (job #1656958) | Cod sursa (job #392658) | Cod sursa (job #1616003) | Cod sursa (job #1910712)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("cautbin.in");
ofstream g("cautbin.out");
int n, x, v[100001], q, m;
int cautBin(int val)
{
int st = 1, dr = n, mid;
while(st<dr)
{
mid = (st+dr)/2;
if(v[mid] == val && v[mid+1]!=val)
return mid;
if(v[mid] > val)
dr = mid;
else st = mid + 1;
}
return -1;
}
int cautBin2(int val)
{
int st = 1, dr = n, mid;
while(st < dr)
{
mid = (st+dr)/2;
if(v[mid] <= val)
st = mid + 1;
else dr = mid;
}
if(v[st] > val) st--;
return st;
}
int cautBin3(int val)
{
int st = 1, dr = n, mid;
while(st < dr)
{
mid = (st+dr)/2;
if(v[mid] >= val)
dr = mid;
else
st = mid+1;
}
if(v[mid]<val)
mid++;
return mid;
}
int main()
{
int i, nr;
f>>n;
for(i=1;i<=n;i++) f>>v[i];
f>>m;
for(int i=1;i<=m;i++)
{
f>>q>>nr;
if(q == 0) g<<cautBin(nr)<<'\n';
else if(q == 1) g<<cautBin2(nr)<<'\n';
else g<<cautBin3(nr)<<'\n';
}
return 0;
}