Cod sursa(job #2037085)
Utilizator | Data | 11 octombrie 2017 18:20:36 | |
---|---|---|---|
Problema | Cautare binara | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 1.27 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("cautbin.in");
ofstream fout("cautbin.out");
int i,n,m,k,x,v[100005],j,g,c;
int main()
{
fin>>n;
for(i=1; i<=n; i++)
{
fin>>v[i];
}
fin>>g;
for (k=1; k<=g; k++)
{
fin>>c>>x;
if (c==0)
{
i=1;
j=n;
while (i<=j)
{
m=(i+j)/2;
if (v[m]<=x)
i=m+1;
else
j=m-1;
}
if (v[j]==x)
fout<<j<<"\n";
else
fout<<"-1\n";
}
if (c==1)
{
i=1;
j=n;
while (i<=j)
{
m=(i+j)/2;
if (v[m]<=x)
i=m+1;
else
j=m-1;
}
fout<<j<<"\n";
}
if (c==2)
{
i=1;
j=n;
while (i<=j)
{
m=(i+j)/2;
if (v[m]>=x)
j=m-1;
else
i=m+1;
}
fout<<i<<"\n";
}
}
return 0;
}