Pagini recente » Cod sursa (job #2627082) | Borderou de evaluare (job #2767939) | Cod sursa (job #1790518) | Cod sursa (job #1494608) | Cod sursa (job #383256)
Cod sursa(job #383256)
#include<iostream.h>
#include<conio.h>
int main()
{
int max=0,st,dr,mij,poz,N,v[50],x,i,E,y,z;
cin>>x;
cin>>N;
cin>>E;
for(i=1;i<=N;i++)
cin>>v[i];
dr=N+1;
st=0;
mij=(dr+st)/2;
while(st+1<dr)
{
if(x<=v[mij])
{dr=mij;
mij=(dr+st)/2;
}
if(x>v[mij])
{st=mij;
mij=(dr+st)/2;
}
}
if(E==0)
{while(x==v[mij+1])
{
mij=mij+1;
}
cout<<mij<<endl;
}
E=1;
if(E==1)
{
if(x==mij)
cout<<mij<<endl;
else
{
y=v[st];
while(y==v[st+1])
st=st+1;
cout<<st<<endl;
}
}
E=2;
if(E==2)
{
if(x==mij)
{while(x==v[mij-1])
mij=mij-1;
cout<<mij<<endl;
}
else
{
z=v[dr];
while(z==v[dr-1])
dr=dr-1;
cout<<dr<<endl;
}
}
getch();
}