Cod sursa(job #2032620)
Utilizator | Data | 5 octombrie 2017 14:58:06 | |
---|---|---|---|
Problema | Cautare binara | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 2.32 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 && g==0)
{
m=(i+j)/2;
if (v[m]==x)
{
p=i;
g=1;
}
else
{
if (v[m]>x)
j=m-1;
else
i=m+1;
}
}
while(v[p+1]==x)
p++;
fout<<p<<"\n";
}
if (c==1)
{
g=0;
i=1;
j=n;
p=0;
while (i<=j && g==0)
{
m=(i+j)/2;
if (v[m]==x)
{
p=i;
g=1;
}
else
{
if (v[m]>x)
j=m-1;
else
i=m+1;
}
}
if (g==0)
{
fout<<j<<"\n";
}
else
{
while(v[p+1]==x)
p++;
fout<<p<<"\n";
}
}
if (c==2)
{
g=0;
i=1;
j=n;
p=0;
while (i<=j && g==0)
{
m=(i+j)/2;
if (v[m]==x)
{
p=i;
g=1;
}
else
{
if (v[m]>x)
j=m-1;
else
i=m+1;
}
}
if (g==0)
{
fout<<i;
}
else
{
while(v[p]==x)
p--;
p++;
fout<<p;
}
}
}
return 0;
}