Pagini recente » Cod sursa (job #572229) | Cod sursa (job #2096004) | Cod sursa (job #1440504) | Cod sursa (job #535942) | Cod sursa (job #2207699)
#include <fstream>
#include <iostream>
using namespace std;
ifstream f("cautbin.in");
ofstream g("cautbin.out");
int n, v[100005], x, cer, q;
int cautbin0(int nr)
{
int st=1, dr=n, mid;
if(v[dr]==nr) return dr;
while(st<dr)
{
mid=st+(dr-st)/2;
if(v[mid]==nr && v[mid+1]!=nr)
return mid;
if(v[mid]>nr) dr=mid;
else st=mid;
}
return -1;
}
int cautbin1(int nr)
{
int st=1, dr=n, mid;
if(v[dr]==nr) return dr;
while(st<dr)
{
mid=st+(dr-st)/2;
if(v[mid]<=nr && v[mid+1]>nr)
return mid;
if(v[mid]>nr) dr=mid;
else st=mid;
}
return -1;
}
int cautbin2(int nr)
{
int st=1, dr=n, mid;
if(v[st]==nr) return dr;
while(st<dr)
{
mid=st+(dr-st)/2;
if(v[mid]>=nr && v[mid-1]<nr)
return mid;
if(v[mid]>=nr) dr=mid;
else st=mid;
}
return -1;
}
int main()
{
f>>n;
for(int i=1; i<=n; i++)
f>>v[i];
f>>q;
for(int i=1; i<=q; i++)
{f>>cer>>x;
if(cer==0)
g<<cautbin0(x)<<'\n';
else if(cer==1)
g<<cautbin1(x)<<'\n';
else if(cer==2)
g<<cautbin2(x)<<'\n';
}
return 0;
}