Cod sursa(job #1959597)
Utilizator | Andrada Cojocaru andradacojocaru | Data | 9 aprilie 2017 17:58:22 |
---|---|---|---|
Problema | Cautare binara | Scor | 10 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.93 kb |
#include <iostream>
#include <fstream>
using namespace std;
int v[100001];
int main()
{
ifstream fin("cautbin.in");
ofstream fout("cautbin.out");
int n,m,i,x,c,ok,j;
fin>>n;
for(i=1;i<=n;i++)
fin>>v[i];
fin>>m;
for(i=1;i<=m;i++)
{
ok=0;
fin>>c>>x;
if(c==0)
{
for(j=n;j>=1 && ok==0;j--)
if(v[j]==x)
{
fout<<j<<'\n';
ok=1;
}
if(ok==0)
fout<<-1<<'\n';
}
if(c==1)
for(j=n;j>1;j--)
if(v[j]<=x)
{
fout<<j<<'\n';
break;
}
if(c==2)
{
for(j=1;j<=n;j++)
if(v[j]>=x)
{
fout<<j<<'\n';
break;
}
}
}
fin.close();
fout.close();
return 0;
}