Pagini recente » Rating Rares Ionascu (RaresIonascu) | Cod sursa (job #2984446) | Monitorul de evaluare | Cod sursa (job #1186392) | Cod sursa (job #1208652)
#include <fstream>
using namespace std;
int v[100005];
int cautbin0(int st, int dr, int x)
{
int med;
while (st<=dr)
{
med=(st+dr)/2;
if (v[med]<=x)
st=med+1;
else
dr=med-1;
}
med=(st+dr)/2;
while (v[med]>x) med--;
if (v[med]==x) return med;
else return -1;
}
int cautbin1(int st, int dr, int x)
{
int med;
while (st<=dr)
{
med=(st+dr)/2;
if (v[med]<=x)
st=med+1;
else
dr=med-1;
}
med=(st+dr)/2;
while (v[med]>x) med--;
return med;
}
int cautbin2(int st, int dr, int x)
{
int med;
while (st<dr)
{
med=(st+dr)/2;
if (v[med]<x)
st=med+1;
else
dr=med;
}
while (v[med]<x) med++;
return med;
}
int main()
{
ifstream f("cautbin.in");
ofstream g("cautbin.out");
int i,n,x,tip,nrt;
f>>n;
for (i=1; i<=n; i++) f>>v[i];
f>>nrt;
for (i=1; i<=nrt; i++)
{
f>>tip>>x;
if (tip==0) g<<cautbin0(1,n,x)<<'\n';
if (tip==1) g<<cautbin1(1,n,x)<<'\n';
if (tip==2) g<<cautbin2(1,n,x)<<'\n';
}
return 0;
}