Pagini recente » Cod sursa (job #1454033) | Cod sursa (job #849974) | Cod sursa (job #1695628) | Cod sursa (job #2261237) | Cod sursa (job #2477934)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("cautbin.in");
ofstream fout("cautbin.out");
int n,i,j,m,k,v[100005],x,a;
int x0()
{
int in=1,sf=n,mij;
int ans = -1;
while (in <= sf)
{
mij = in + (sf - in) / 2;
if (v[mij] <= k)
{
ans = mij;
in = mij + 1;
}
else
{
sf = mij - 1;
}
}
if (v[ans]==k)
return ans;
return -1;
}
int x1()
{
int in=1,sf=n,mij;
int ans = -1;
while (in <= sf)
{
mij = in + (sf - in) / 2;
if (v[mij] <= k)
{
ans = mij;
in = mij + 1;
}
else
{
sf = mij - 1;
}
}
return ans;
}
int x2()
{
int in=1,sf=n,mij;
int ans = -1;
while (in <= sf)
{
mij = in + (sf - in) / 2;
if (v[mij] >= k)
{
ans = mij;
sf = mij - 1;
}
else
{
in = mij + 1;
}
}
return ans;
}
int main()
{
int mij;
fin>>n;
for(i=1; i<=n; i++)
fin>>v[i];
fin>>m;
for(i=1; i<=m; i++)
{
fin>>a>>k;
if(a==0)
fout<<x0()<<" ";
if(a==1)
fout<<x1()<<" ";
if(a==2)
fout<<x2()<<" ";
}
}