Cod sursa(job #2334467)
Utilizator | Data | 2 februarie 2019 17:41:56 | |
---|---|---|---|
Problema | Cautare binara | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 1.1 kb |
#include <fstream>
using namespace std;
int v[100001];
ifstream cin("cautbin.in");
ofstream cout("cautbin.out");
int main()
{
int p,a,m,n,x,ok;
cin>>n;
for(int i=1;i<=n;i++)
cin>>v[i];
cin>>m;
for(int i=1;i<=m;i++)
{
ok=0;
cin>>p>>x;
if(p==0)
{
for(int j=n;j>=1;j--)
if(v[j]==x)
{
cout<<j<<'\n';
ok=1;
break;
}
if(ok==0)
cout<<-1;
}
else if(p==1)
{
for(int j=n;j>=1;j--)
if(v[j]<=x)
{
cout<<j<<'\n';
ok=1;
break;
}
if(ok==0)
cout<<-1;
}
else if(p==2)
{
for(int j=1;j<=i;j++)
if(v[j]>=x)
{
cout<<j<<'\n';
ok=1;
break;
}
if(ok==0)
cout<<-1;
}
}
return 0;
}