Cod sursa(job #1672014)
Utilizator | Data | 2 aprilie 2016 12:17:17 | |
---|---|---|---|
Problema | Cautare binara | Scor | 40 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.82 kb |
#include <fstream>
using namespace std;
ifstream fin("cautbin.in");
ofstream fout("cautbin.out");
int n,i,q,ind,id,x,v[100001];
int main()
{
fin>>n;
for(i=1;i<=n;i++)
fin>>v[i];
fin>>q;
for(i=1;i<=q;i++)
{
fin>>id>>x;
if(id==0)
{
ind=1;
while(v[ind]<=x&&ind<=n)
ind++;
if(v[ind-1]==x)
fout<<ind-1<<'\n';
else
fout<<-1<<'\n';
}
if(id==1)
{
ind=1;
while(v[ind]<=x&&ind<=n)
ind++;
fout<<ind-1<<'\n';
}
if(id==2)
{
ind=1;
while(v[ind]<x&&ind<=n)
ind++;
fout<<ind<<'\n';
}
}
return 0;
}