Pagini recente » Cod sursa (job #2933990) | Cod sursa (job #1057971) | Cod sursa (job #242022) | PreOJI 2016 - Clasament - Clasele 11-12 | Cod sursa (job #2801201)
#include <fstream>
using namespace std;
ifstream a ("cautbin.in");
ofstream b ("cautbin.out");
int n,i,v[100010],m,c,x;
void citire (int n,int v[])
{
for (i=1;i<=n;i++)
{
a>>v[i];
}
}
int c0 (int x,int dr)
{
int st=1,poz=0,m;
while (st<=dr)
{
m=(st+dr)/2;
if(v[m]<=x)
{
st=m+1;
if (v[m]==x)poz=m;
}
else dr=m-1;
}
if (poz==0)return -1;
return poz;
}
int c1(int x,int dr)
{
int st=1,poz=0,m;
while (st<=dr)
{
m=(st+dr)/2;
if(v[m]<=x){poz=m;st=m+1;}
else dr=m-1;
}
return poz;
}
int c2(int x,int dr)
{
int st=1,poz=0,m;
while (st<=dr)
{
m=(st+dr)/2;
if(v[m]<x)st=m+1;
else {poz=m;dr=m-1;}
}
return poz;
}
int main()
{
a>>n;
citire(n,v);
a>>m;
for (i=1;i<=m;i++)
{
a>>c>>x;
if (c==0)b<<c0(x,n)<<'\n';
if (c==1)b<<c1(x,n)<<'\n';
if (c==2)b<<c2(x,n)<<'\n';
}
return 0;
}