Pagini recente » Cod sursa (job #2683398) | Cod sursa (job #1738314) | Diferente pentru implica-te/arhiva-educationala intre reviziile 38 si 37 | Cod sursa (job #2197727) | Cod sursa (job #1051768)
#include <fstream>
using namespace std;
ifstream f("cautbin.in");
ofstream g("cautbin.out");
int v[10005],n;
int op0(int x)
{
int st,dr,mij;
st=1;dr=n;
while(st<dr)
{
mij=(st+dr)/2;
if(v[mij]<x)st=mij+1;
else dr=mij;
}
for(;st<n&&v[st]==x;++st);
if(v[st]>x)--st;
if(v[st]!=x)return -1;
return st;
}
int op1(int x)
{
int st=1,dr=n,mij;
while(st<dr)
{
mij=(st+dr+1)/2;
if(v[mij]>x)dr=mij-1;
else st=mij;
}
return st;
}
int op2(int x)
{
int st=1,dr=n,mij;
while(st<dr)
{
mij=(st+dr)/2;
if(v[mij]<x)st=mij+1;
else dr=mij;
}
return st;
}
int main()
{
int x,tip,m;
f>>n;
for(int i=1;i<=n;i++)f>>v[i];
f>>m;
f>>tip;
f>>x;
for(int i=1;i<=m;i++){
if(tip==0)
g<<tip<<" "<<op0(x)<<" ";
if(tip==1)
g<<tip<<" "<<op1(x);
if(tip==2)
g<<tip<<" "<<op2(x);}
}