Pagini recente » Borderou de evaluare (job #1940279) | Borderou de evaluare (job #2392009) | Borderou de evaluare (job #1091220) | Borderou de evaluare (job #2374015) | Cod sursa (job #608674)
Cod sursa(job #608674)
#include<fstream>
using namespace std;
int v[100005],n,m,val;
int cautare_bin1(int st,int dr,int x)
{
int mij;
while(st<=dr)
{
mij=(st+dr)/2;
if(v[mij]<=x)
st=mij+1;
else
dr=mij-1;
}
mij=(st+dr)/2;
if(v[mij]>x)
mij--;
if(v[mij]==x)
return mij;
return -1;
}
int cautare_bin2(int st,int dr,int x)
{
int mij;
while(st<dr)
{
mij=st+(dr-st)/2;
if(v[mij]<=x)
st=mij+1;
else
dr=mij;
}
mij=st+(dr-st)/2;
if(v[mij]>x)
--mij;
return mij;
}
int cautare_bin3(int st,int dr,int x)
{
int mij;
while(st<dr)
{
mij=st+(dr-st)/2;
if(v[mij]<x)
st=mij+1;
else
dr=mij;
}
mij=st+(dr-st)/2;
if(v[mij]<x)
mij++;
return mij;
}
int main()
{
ifstream fin("cautbin.in");
ofstream fout("cautbin.out");
fin>>n;
int i;
for(i=1;i<=n;i++)
fin>>v[i];
fin>>m;
int x;
for(i=1;i<=m;i++)
{
fin>>val>>x;
if(val==0)
{
fout<<cautare_bin1(1,n,x)<<endl;
}
else
if(val==1)
{
fout<<cautare_bin2(1,n,x)<<endl;
}
else
if(val==2)
{
fout<<cautare_bin3(1,n,x)<<endl;
}
}
fin.close();
fout.close();
return 0;
}