Pagini recente » Cod sursa (job #2746447) | Cod sursa (job #262418) | Cod sursa (job #1461058) | Cod sursa (job #1383226) | Cod sursa (job #1674451)
#include<fstream>
using namespace std;
ifstream f("cautbin.in");
ofstream g("cautbin.out");
int n,t,x,y,v[100001];
int caut0(int p,int u,int numar)
{
int m;
while(p<=u)
{
m=(u+p)/2;
if(v[m]<=numar)
p=m+1;
else u=m-1;
}
m=(u+p)/2;
if(v[m]>numar) m--;
if(v[m]==numar)
return m+1;
return -1;
}
int caut1(int p,int u,int numar)
{
int m;
while(p<u)
{
m=(u+p)/2;
if(v[m]<=numar)
p=m+1;
else u=m;
}
m=(u+p)/2;
if(v[m]>numar) m--;
return m+1;
}
int caut2(int p,int u,int numar)
{
int m;
while(p<u)
{
m=(u+p)/2;
if(v[m]<numar)
p=m+1;
else u=m;
}
m=(u+p)/2;
if(v[m]<numar) m++;
return m+1;
}
int main()
{
f>>n;
for(int i=0; i<n; i++)
f>>v[i];
f>>t;
for(int i=1; i<=t; i++)
{
f>>x>>y;
if(x==0)
{
g<<caut0(0,n-1,y)<<endl;
}
else if(x==1)
{
g<<caut1(0,n-1,y)<<endl;
}
else if(x==2)
{
g<<caut2(0,n-1,y)<<endl;
}
}
return 0;
}