Pagini recente » Cod sursa (job #1394589) | La capatul lumii | Cod sursa (job #1372225) | Cod sursa (job #2917876) | Cod sursa (job #661683)
Cod sursa(job #661683)
#include<fstream>
using namespace std;
int v[100002];
int cazul_0(int val,int st,int dr)
{ int mid;
while(st<=dr)
{mid=(st+dr)/2;
if(v[mid]<=val) st=mid+1;
else dr=mid-1;}
mid=(st+dr)/2;
if(v[mid]>val) mid--;
if(v[mid]==val) return mid;
else return -1;}
int cazul_1(int val, int st, int dr)
{ int mid;
while(st<dr)
{ mid=(st+dr)/2;
if(v[mid]<=val) st=mid+1;
else dr=mid;}
mid=(st+dr)/2;
if(v[mid]>val) mid--;
return mid;}
int cazul_2(int val, int st, int dr)
{ int mid;
while(st<dr)
{mid=(st+dr)/2;
if(v[mid]<val) st=mid+1;
else dr=mid; }
mid=(st+dr)/2;
if(v[mid]<val) mid++;
return mid; }
int main()
{ int N, M, caz, x;
fstream f("cautbin.in", ios::in);
fstream g("cautbin.out", ios::out);
f>>N;
for(int i=1;i<=N;i++)
f>>v[i];
f>>M;
for(int i=0;i<M;i++){
f>>caz>>x;
if(caz==0) g<<cazul_0(x,0,N-1)<<endl;
if(caz==1) g<<cazul_1(x,0,N-1)<<endl;
if(caz==2) g<<cazul_2(x,0,N-1)<<endl;
}
f.close();
g.close();
return 0;
}