Pagini recente » Cod sursa (job #1281360) | Cod sursa (job #1801422) | Cod sursa (job #2511807) | Cod sursa (job #538340) | Cod sursa (job #1335655)
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("cautbin.in");
ofstream out("cautbin.out");
int n,V[100001];
void readArray(){
in>>n;
for(int i=1;i<=n;i++)
in>>V[i];
}
int binary0(int e,int u,int x){
int m;
while(e!=u)
{
m=(e+u)/2;
if (V[m]<x)
u=m;
else if(x<V[m])
e=m;
else{
e=m;
u=m;
}
}
while(V[m]==V[m+1])
m+=1;
if(V[m]==x)
return m;
else
return -1;
}
int binary1(int e,int u,int x){
int m;
while(e!=u)
{
m=(e+u)/2;
if (V[m]>x)
u=m;
else if(V[m]<x)
e=m;
else
{
e=m;
u=m;
}
}
while(V[m]>x)
m--;
while(V[m]==V[m+1])
m+=1;
if(V[m]==x)
return m;
else
return -1;
}
int binary2(int e,int u,int x){
int m;
while(e!=u)
{
m=(e+u)/2;
if (V[m]>x)
u=m;
else if(V[m]<x)
e=m;
else
{
e=m;
u=m;
}
}
while(V[m]<x)
m++;
while(V[m]==V[m-1])
m-=1;
return m;
}
int main()
{
readArray();
int m,k,x;
in>>m;
for (int i=1;i<=m;i++)
{
in>>k>>x;
switch (k){
case 0:
out<<binary0(1,n,x)<<endl;
break;
case 1:
out<<binary1(1,n,x)<<endl;
break;
case 2:
out<<binary2(1,n,x)<<endl;
break;
}
}
in.close();
out.close();
return 0;
}