Pagini recente » Istoria paginii runda/eusebiu_oji_2014_cls9/clasament | Cod sursa (job #2657238) | Cod sursa (job #2785303) | Cod sursa (job #1254140) | Cod sursa (job #1344916)
#include <iostream>
#include <fstream>
using namespace std;
int a[100000];
int bin0(int p,int u,int x)
{
int m;
while (p<=u)
{
m=(p+u)/2;
if (a[m]<=x)
p=m+1;
else
u=m-1;
}
m=(p+u)/2;
if (a[m]>x) m--;
if (a[m]==x)
return m;
return -1;
}
int bin1(int p,int u,int x)
{
int m;
while (p<=u)
{
m=(p+u)/2;
if (a[m]<=x)
p=m+1;
else
u=m-1;
}
m=(p+u)/2;
if (a[m]>x) m--;
return m;
}
int bin2(int p,int u,int x)
{
int m;
while (p<=u)
{
m=(p+u)/2;
if (a[m]<x)
p=m+1;
else
u=m-1;
}
m=(p+u)/2;
if (a[m]<x) m++;
return m;
}
int main()
{
ifstream f("in.txt");
ofstream g("out.txt");
int n,i,m,x,y;
f>>n;
for (i=1;i<=n;i++)
f>>a[i];
f>>m;
for (i=1;i<=m;i++)
{
f>>x>>y;
if (x==0)
g<<bin0(1,n,y)<<'\n';
if (x==1)
g<<bin1(1,n,y)<<'\n';
if (x==2)
g<<bin2(1,n,y)<<'\n';
}
return 0;
}