Pagini recente » Cod sursa (job #1025042) | Cod sursa (job #2625656) | Cod sursa (job #882137) | Cod sursa (job #460244) | Cod sursa (job #2477847)
#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;
while(in<sf)
{
mij=(in+sf)/2;
if(v[mij]==k)
{
if(v[mij+1]>k)
return mij;
else
in=mij+1;
}
else if(v[mij]<k)
in=mij+1;
else
sf=mij-1;
}
return -1;
}
int x1()
{
int in=1,sf=n,mij;
while(in<sf)
{
mij=(in+sf)/2;
if(v[mij]==k)
{
if(v[mij+1]>k)
return mij;
else
in=mij+1;
}
else if(v[mij]<k)
in=mij+1;
else
sf=mij-1;
}
}
int x2()
{
return 0;
}
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()<<" ";
}
}