Cod sursa(job #1879922)
Utilizator | Data | 15 februarie 2017 11:32:59 | |
---|---|---|---|
Problema | Cautare binara | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 2.31 kb |
#include <fstream>
using namespace std;
ifstream fin("cautbin.in");
ofstream fout("cautbin.out");
int v[100002];
int n,m,p,x;
int caut_0(int x)
{
int dr=n;
int st=1;
while(st<=dr)
{
int mij=(dr+st)/2;
if(v[mij]==x)
{
if(mij==n)
{
return n;
}
else
{
if(v[mij+1]>x)
{
return mij;
}
else
{
st=mij+1;
}
}
}
else
{
if(v[mij]>x)
{
dr=mij-1;
}
else
{
st=mij+1;
}
}
}
return -1;
}
int caut_1(int x)
{
int st=1;
int dr=n;
while(st<=dr)
{
int mij=(st+dr)/2;
if(v[mij]<=x)
{
if(mij==n)
{
return n;
}
else
{
if(v[mij+1]>x)
{
return mij;
}
else
{
st=mij;
}
}
}
else
{
st=mij+1;
}
}
return -1;
}
int caut_2(int x)
{
int st=1;
int dr=n;
while(st<=dr)
{
int mij=(dr+st)/2;
if(v[mij]>=x)
{
if(v[mij-1]<x)
{
return mij;
}
else
{
if(mij==1)
{
return 1;
}
else
{
dr=mij;
}
}
}
else
{
dr=mij-1;
}
}
return -1;
}
int main()
{
fin>>n;
for(int i=1;i<=n;i++)
{
fin>>v[i];
}
fin>>m;
for(int i=1;i<=m;i++)
{
fin>>p>>x;
if(p==0)
{
fout<<caut_0(x);
}
if(p==1)
{
fout<<caut_1(x);
}
if(p==2)
{
fout<<caut_2(x);
}
fout<<endl;
}
return 0;
}