Pagini recente » Cod sursa (job #1345972) | Cod sursa (job #1289381) | Istoria paginii runda/mnmxmnmxmnmx_what | Cod sursa (job #2365197) | Cod sursa (job #2277651)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("cautbin.in");
ofstream g("cautbin.out");
int cautbin(int st, int dr, int v[10000], int x)
{
int m=(st+dr)/2;
if(st<dr)
if(v[m]>x)
return cautbin(st,m,v,x);
else if(v[m]<x)
return cautbin(m+1,dr,v,x);
else if(v[m]==x)
{while(v[m]==v[m+1])
m++;
return m;}
if(st==dr && v[st]==x)
{
while(v[st]==v[st+1])
st++;
return st;
}
else
return -1;
}
int cautbin2(int st, int dr, int v[10000], int x)
{
int m=(st+dr)/2;
if(st<dr)
if(v[m]>x)
return cautbin(st,m,v,x);
else if(v[m]<x)
return cautbin(m+1,dr,v,x);
else if(v[m]==x)
{while(v[m]==v[m-1])
m--;
return m;}
if(st==dr && v[st]==x)
{
while(v[st]==v[st-1])
st--;
return st;
}
else
return -1;
}
int main()
{
int n,v[10000],x,m,a;
f>>n;
for(int i=1; i<=n; i++)
f>>v[i];
f>>m;
for(int i=1; i<=m; i++)
{
f>>a>>x;
if(a==0 || a==1)
g<<cautbin(1,n,v,x)<<endl;
if(a==2)
g<<cautbin2(1,n,v,x)+1<<endl;
}
return 0;
}