Pagini recente » Cod sursa (job #1983192) | Cod sursa (job #1463719) | Cod sursa (job #1785015) | Cod sursa (job #2704537) | Cod sursa (job #1379415)
#include <fstream>
#include <iostream>
#define fin "cautbin.in"
#define fou "cautbin.out"
using namespace std;
long sir[100001];
int n,m;
/*int cbin0(int st,int dr,long x)
{
long mid;
while(st<=dr)
{
mid=(st+dr)/2;
if(sir[mid]<=x) st=mid+1;
else dr=mid-1;
}
mid=(st+dr)/2;
if(sir[mid]>x) mid--;
if(sir[mid]==x) return mid;
return -1;
}
int cbin1(int st,int dr,long x)
{
long mid;
while(st<dr)
{
mid=(st+dr)/2;
if(sir[mid]<=x) st=mid+1;
else dr=mid;
}
mid=(st+dr)/2;
if(sir[mid]>x) mid--;
return mid;
}
int cbin2(int st,int dr,long x)
{
long mid;
while(st<dr)
{
mid=(st+dr)/2;
if(sir[mid]<x) st=mid+1;
else dr=mid;
}
mid=(st+dr)/2;
if(sir[mid]>x) mid++;
return mid;
}*/
int bsearch0 (int p, int u, int key) {
int m;
while (p <= u) {
m = (p + u) / 2;
if (sir[m] <= key)
p = m + 1;
else
u = m - 1;
}
m = (p + u) / 2;
if (sir[m] > key) m --;
if (sir[m] == key)
return m;
return -1;
}
int bsearch1 (int p, int u, int key) {
int m, n = u;
while (p < u){
m = (p + u) / 2;
if (sir[m] <= key)
p = m + 1;
else
u = m;
}
m = (p + u) / 2;
if (sir[m] > key)
-- m;
return m;
}
int bsearch2 (int p, int u, int key) {
int m;
while (p < u) {
m = (p + u) / 2;
if (sir[m] < key)
p = m + 1;
else
u = m;
}
m = (p + u) / 2;
if (sir[m] < key)
++ m;
return m;
}
int main()
{
ifstream t1(fin);
ofstream t2(fou);
int i,j,mod,val,poz,ok;
t1>>n;
for(i=1;i<=n;i++) t1>>sir[i];
t1>>m;
for(i=1;i<=m;i++)
{
t1>>mod>>val;
if(mod==0) t2<<bsearch0(1,n,val)<<'\n';
if(mod==1) t2<<bsearch1(1,n,val)<<'\n';
if(mod==2) t2<<bsearch2(1,n,val)<<'\n';
}
t2.close();
t2.close();
return 0;
}