Pagini recente » Cod sursa (job #1514966) | Cod sursa (job #1668071) | Istoria paginii runda/gladiators1/clasament | Cod sursa (job #644740) | Cod sursa (job #2285587)
#include <iostream>
#include <fstream>
using namespace std;
int n,i,v[10000],mid,st,dr,el,poz;
ifstream f("cautbin.in");
ofstream g("cautbin.out");
int main()
{
f>>n>>el;
for(i=1;i<=n;i++)
f>>v[i];
st=0;
dr=n;
mid=(st+dr+1)/2;
f>>M;
for(i=0;i<=M;i++)
{
while(el!=v[mid] && mid!=st)
{
if(el>v[mid])
{
st=mid;
mid=(st+dr+1)/2;
}
else
{
dr=mid;
mid=(st+dr)/2;
}
if(poz<mid)
poz=mid;
}
g<<poz;
}
return 0;
}