Pagini recente » Cod sursa (job #2145560) | Cod sursa (job #1752048) | Cod sursa (job #3226958) | Cod sursa (job #2988219) | Cod sursa (job #669703)
Cod sursa(job #669703)
#include <fstream>
using namespace std;
ifstream f("cautbin.in");
ofstream g("cautbin.out");
const int maxn=100005;
unsigned long long a[maxn], y;
unsigned int n, m, x, i;
int caut_bin0(long long x)
{
unsigned int st=1, dr=n;
while(st<=dr)
{
unsigned int mij=(st+dr)/2;
if(x==a[mij] && a[mij]<a[mij+1]) return mij;
if(x>=a[mij]) st=mij;
else dr=mij;
}
return -1;
}
int caut_bin1(long long x)
{
unsigned int st=1, dr=n;
while(st<=dr)
{
unsigned int mij=(st+dr)/2;
if(a[mij]<=x && a[mij+1]>x) return mij;
else if(a[mij]<=x && a[mij-1]<=x) st=mij;
else if(a[mij]>x && a[mij+1]>x) dr=mij;
}
}
int caut_bin2(long long x)
{
unsigned int st=1, dr=n;
while(st<=dr)
{
unsigned int mij=(st+dr)/2;
if(a[mij]>=x && a[mij-1]<x) return mij;
else if(a[mij]>=x && a[mij+1]>=x) dr=mij;
else if(a[mij]<x && a[mij+1]<x) st=mij;
}
}
int main()
{
f>>n;
for(i=1; i<=n; ++i) f>>a[i];
for(f>>m; m; --m)
{
f>>x>>y;
if(x==0) g<<caut_bin0(y)<<"\n";
else if(x==1) g<<caut_bin1(y)<<"\n";
else if(x==2) g<<caut_bin2(y)<<"\n";
}
return 0;
}