Cod sursa(job #2059085)
Utilizator | Data | 6 noiembrie 2017 17:21:48 | |
---|---|---|---|
Problema | Cautare binara | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 1.58 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("cautbin.in");
ofstream fout("cautbin.out");
int c,p,l,r,v[100004],x,n,m,i;
int main()
{
fin>>n;
for(i=1;i<=n;i++)
{
fin>>v[i];
}
fin>>m;
for(i=1;i<=m;i++)
{
fin>>c>>x;
if(c==0)
{
l=1;
r=n;
while(l<=r)
{
p=(l+r)/2;
if(v[p]<=x)
{
l=p+1;
}
else
{
r=p-1;
}
}
if(v[r]==x)
{
fout<<r;
}
else
{
fout<<-1;
}
}
if(c==1)
{
l=1;
r=n;
while(l<=r)
{
p=(l+r)/2;
if(v[p]<=x)
{
l=p+1;
}
else
{
r=p-1;
}
}
fout<<r;
}
if(c==2)
{
l=1;
r=n;
while(l<=r)
{
p=(l+r)/2;
if(v[p]>=x)
{
r=p-1;
}
else
{
l=p+1;
}
}
fout<<l;
}
fout<<"\n";
}
fin.close();
fout.close();
return 0;
}