Pagini recente » Cod sursa (job #208479) | Cod sursa (job #995500) | Cod sursa (job #2585211) | Cod sursa (job #1977506) | Cod sursa (job #2329827)
#include <iostream>
#include <fstream>
using namespace std;
int main()
{
ifstream fi("cautbin.in");
ofstream fo("cautbin.out");
int n,v[1001],x ;
fi>>n;
int i;
for(i=1;i<=n;i++)
{
fi>>v[i];
}
int m;
fi>>m;
for(int j=0;j<=m;j++)
{
fi>>j>>x;
}
int st=1,dr=n,mi;
while(st!=dr)
{
mi=(st+dr)/2;
if(v[mi]>x)
{
dr=mi;
}else
{
st=mi+1;
}
}
if(v[mi]==x)
{
fo<<mi<<"\n"<<mi<<"\n";
}else
{
fo<<-1<<"\n";
st=1;
dr=n;
while(dr-st!=1)
{
mi=(st+dr)/2;
if(v[mi]<x)
{
st=mi;
}
else
{
dr=mi;
}
}
fo<<st<<"\n";
}
st=1;
dr=n;
while(st!=dr)
{
mi=(st+dr)/2;
if(v[mi]>=x)
{
dr=mi;
}
else
{
st=mi+1;
}
}
fo<<st;
return 0;
}