Cod sursa(job #1773514)
| Utilizator | Data | 7 octombrie 2016 21:57:52 | |
|---|---|---|---|
| Problema | Cautare binara | Scor | 40 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 1.3 kb |
#include <fstream>
using namespace std;
int n,v[100020],hi,lo,mid;
int down(int b)
{
lo=0;
hi=n;
while(lo<=hi){
mid=(hi+lo)/2;
if(b<=v[mid])
{
hi=mid-1;
}
else
{
lo=mid+1;
}
}
return lo;
}
int up(int b)
{
lo=0;
hi=n;
while(lo<=hi){
mid=(hi+lo)/2;
if(b>=v[mid])
{
lo=mid+1;
}
else
{
hi=mid-1;
}
}
return hi;
}
int main()
{
int h,i,j,k,a,b,m;
ifstream fin ("cautbin.in");
ofstream fout ("cautbin.out");
fin>>n;
for(i=1;i<=n;++i)
{
fin>>v[i];
}
fin>>m;
for(i=1;i<=m;++i)
{
fin>>a>>b;
if(a==1)
{
fout<<up(b)<<endl;
}
else if(a==2)
{
fout<<down(b)<<endl;
}
else
{
h=up(b);
if(v[h]==b)
{
fout<<h<<endl;
}
else
{
fout<<"-1"<<endl;
}
}
}
return 0;
}
