Pagini recente » Istoria paginii utilizator/mihnea_buzoiu | Cod sursa (job #1186043) | Cod sursa (job #761343) | Istoria paginii utilizator/milenapopa | Cod sursa (job #1888196)
#include <fstream>
using namespace std;
ifstream f("numere9.in");
ofstream g("numere9.out");
int ls,ld,n,m,a,b,mijl,i,v[100001],j,x;
int main()
{
f>>n;
for(i=1;i<=n;i++)
f>>v[i];
f>>m;
{f>>a>>b;
if(a==0)
{
ls=1;ld=n;
while(ls<=ld)
{
mijl=(ls+ld)/2;
if(v[mijl]==b)
{
x=mijl;
}
else
if(b<v[mijl])
ld=mijl-1;
else
ls=mijl+1;
}if(ls>ld)
g<<-1<<'\n';
else
g<<x<<'\n';
}
}
return 0;
}