Cod sursa(job #2537119)
Utilizator | Data | 3 februarie 2020 09:13:45 | |
---|---|---|---|
Problema | Cautare binara | Scor | 40 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 2.12 kb |
#include <fstream>
using namespace std;
ifstream f("cautbin.in");
ofstream g("cautbin.out");
int N, M, i, optiune, x, p, q, ok, mij;
int main()
{
f>>N;
int v[N+1];
for(i=1; i<=N; ++i)
f>>v[i];
f>>M;
for(i=1; i<=M; ++i)
{
f>>optiune>>x;
ok=0;
if(optiune==0)
{
p=1;
q=N;
while(p<=q && ok==0)
{
mij=(p+q)/2;
if(v[mij]==x)
{
while(v[mij+1]==x)
mij++;
ok=1;
}
else
if(x<v[mij])
q=mij-1;
else p=mij+1;
}
if(ok==1)
g<<mij<<'\n';
else g<<-1<<'\n';
}
if(optiune==1)
while(ok==0)
{
p=1;
q=N;
ok=0;
while(p<=q && ok==0)
{
mij=(p+q)/2;
if(v[mij]==x)
{
while(v[mij+1]==x)
mij++;
ok=1;
}
else
if(x<v[mij])
q=mij-1;
else p=mij+1;
}
if(ok==1)
g<<mij<<'\n';
else x--;
}
if(optiune==2)
while(ok==0)
{
p=1;
q=N;
ok=0;
while(p<=q && ok==0)
{
mij=(p+q)/2;
if(v[mij]==x)
{
while(v[mij-1]==x)
mij--;
ok=1;
}
else
if(x<v[mij])
q=mij-1;
else p=mij+1;
}
if(ok==1)
g<<mij<<'\n';
else x++;
}
}
return 0;
}