Pagini recente » Cod sursa (job #1451238) | Cod sursa (job #1525652) | Cod sursa (job #3157016) | Cod sursa (job #3258528) | Cod sursa (job #661572)
Cod sursa(job #661572)
#include<fstream>
#include<iostream>
using namespace std;
int v[100002],N;
int cazul_2(int val)
{ int mid,st=1,dr=N,p;
while(st<=dr)
{mid=(st+dr)/2;
if(v[mid]>=val)
{p=mid; dr=mid-1;}
else st=mid+1; }
return p; }
int cazul_1(int val)
{ int mid,st=1,dr=N,p;
while(st<=dr)
{mid=(st+dr)/2;
if(v[mid]<=val)
{p=mid; st=mid+1;}
else dr=mid-1; }
return p; }
int cazul_0(int val)
{ int mid,st=1,dr=N,p;
while(st<=dr)
{ mid=(st+dr)/2;
if(v[mid]==val)
{p=mid; st=mid+1; }
else
if(v[mid]<val) st=mid+1;
else dr=mid-1; }
if(v[p]==val) return p;
else return -1; }
int main()
{ int N, M, caz, x, rez;
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=1;i<=M;i++){
f>>caz>>x;
if(caz==0){ rez=cazul_0(x); g<<rez<<endl; }
if(caz==1){ rez=cazul_1(x); g<<rez<<endl; }
if(caz==2){ rez=cazul_2(x); g<<rez<<endl; }
}
f.close();
g.close();
return 0;
}