Cod sursa(job #1413357)
Utilizator | Data | 1 aprilie 2015 20:30:14 | |
---|---|---|---|
Problema | Cautare binara | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 1.3 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("cautbin.in");
ofstream g("cautbin.out");
int n,m,v[100001],i,a,b,vmax,vmin,vmij;
int main()
{
f>>n;
for(i=1;i<=n;i++)
f>>v[i];
f>>m;
for(i=1;i<=m;i++)
{
f>>a>>b;
vmin=1;
vmax=n;
while(vmax>=vmin)
{
vmij=vmin+(vmax-vmin)/2;
if(v[vmij]==b)
{
if(a==0 || a==1)
{
while(v[vmij+1]==b)
{
vmij++;
}
if(a==0) g<<vmij<<"\n";
if(a==1)
{
if(v[vmij]<=b) g<<vmij<<"\n";
}
}
if(a==2)
{
if(v[vmij]==b)
{
while(v[vmij-1]==b)
{
vmij--;
}
g<<vmij<<"\n";
}
}
break;
}
else if(v[vmij]<b)
{
vmin=vmij+1;
}
else vmax=vmij-1;
}
}
return 0;
}