Cod sursa(job #2504324)
| Utilizator | Data | 4 decembrie 2019 20:05:15 | |
|---|---|---|---|
| Problema | Cautare binara | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.86 kb |
#include <bits/stdc++.h>
using namespace std;
int n,m,a[100001];
int caut_0(int x,int n)
{
int st=1,dr=n,mi;
while(st<dr)
{
if(a[st]<x)
st=mi;
if(a[dr]>x)
dr=mi;
if(a[st]==x)
{
while(st<=n&&a[st]==x)
st++;
st--;
return st;
}
if(a[dr]==x)
{
while(dr<=n&&a[dr]==x)
dr++;
dr--;
return dr;
}
}
}
int main()
{
cin>>n;
for(int i=1;i<=n;i++)
{
cin>>a[i];
}
cin>>m;
for(int i=1;i<=m;i++)
{
cin>>c>>x;
if(c==0)
{
cout<<caut_0(x,n);
}
else if(c==1)
cout<<caut_1(x);
else
cout<<cout_2(x);
}
return 0;
}
