Cod sursa(job #2036137)
Utilizator | Data | 10 octombrie 2017 12:58:19 | |
---|---|---|---|
Problema | Cautare binara | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 1.45 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("cautbin.in");
ofstream fout("cautbin.out");
unsigned int n,k,v[100005],f,p,g,x,i,j,m,c;
int main()
{
fin>>n;
for (i=1; i<=n; i++)
fin>>v[i];
fin>>k;
for (f=1; f<=k; f++)
{
fin>>c>>x;
if (c==0)
{
i=1;
j=n;
p=0;
while (i<j)
{
m=(i+j)/2;
if (v[m]<=x)
{
i=m+1;
}
else
{
j=m-1;
}
}
if (v[i]!=x)
i--;
fout<<i<<"\n";
}
if (c==1)
{
i=1;
j=n;
p=0;
while (i<=j)
{
m=(i+j)/2;
if (v[m]<=x)
i=m+1;
else
j=m-1;
}
if (v[i] > x || i> n)
i--;
fout<<i<<"\n";
}
if (c==2)
{
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)
j++;
fout<<j;
}
}
return 0;
}