Pagini recente » Cod sursa (job #3280360) | Cod sursa (job #1242519) | Cod sursa (job #1581997) | Cod sursa (job #2983971) | Cod sursa (job #1369390)
#include<fstream>
using namespace std;
int v[100001];
int intrebare1(int n, int x, int v[])
{
int m,p=1,u=n;
while(p<=u)
{
m=(p+u)/2;
if(v[m]<=x)
p=m+1;
else
u=m-1;
}
m=(u+p)/2;
if(v[m]==x) return m;
return -1;
}
int intrebare2(int n, int x, int v[])
{
int m,p=1,u=n;
while(p<=u)
{
m=(p+u)/2;
if(v[m]<=x)
p=m+1;
else
u=m-1;
}
m=(u+p)/2;
if(v[m]<=x) return m;
}
int intrebare3(int n, int x, int v[])
{
int m,p=1,u=n;
while(p<=u)
{
m=(p+u)/2;
if(v[m]>=x)
u=m-1;
else
p=m+1;
}
m=(u+p)/2+1;
if(v[m]>=x) return m;
}
int main()
{
ifstream f("cautbin.in");
ofstream g("cautbin.out");
int n,m,i,x,y;
f>>n;
for(i=1;i<=n;i++)
{
f>>v[i];
}
f>>m;
for(i=1;i<=m;i++)
{
f>>x>>y;
if(x==0) g<<intrebare1(n,y,v)<<'\n';
else if(x==1) g<<intrebare2(n,y,v)<<'\n';
else g<<intrebare3(n,y,v)<<'\n';
//g<<x<<' '<<y;
}
return 0;
}