Pagini recente » Cod sursa (job #3188883) | Cod sursa (job #2366753) | Cod sursa (job #1402878) | Cod sursa (job #1028301) | Cod sursa (job #1425007)
#include <fstream>
using namespace std;
int n,v[1000001];
const int l=16;
ifstream in("cautbin.in");
ofstream out("cautbin.out");
int cautbin0(int x)
{ int i=0,pas=1<<l;
while(pas!=0)
{ if(i+pas<=n && v[i+pas]<=x) i+=pas;
pas/=2;
}
if(v[i]==x) return i;
return -1;
}
int cautbin1(int x)
{ int i=0,pas=1<<l;
while(pas!=0)
{ if(i+pas<=n && v[i+pas]<=x) i+=pas;
pas/=2;
}
return i;
}
int cautbin2(int x)
{ int i=0,pas=1<<l;
while(pas!=0)
{ if(i+pas<=n && v[i+pas]<x) i+=pas;
pas/=2;
}
return 1+i;
}
int main ()
{ int m,tip,val;
in>>n;
for(int j=1;j<=n;j++) in>>v[j];
in>>m;
for(int i=1;i<=m;i++)
{ in>>tip>>val;
if(tip==0) out<<cautbin0(val)<<'\n';
if(tip==1) out<<cautbin1(val)<<'\n';
if(tip==2) out<<cautbin2(val)<<'\n';
}
out.close();
return 0;
}