Pagini recente » Cod sursa (job #824806) | Cod sursa (job #897119) | Cod sursa (job #1834899) | Cod sursa (job #651163) | Cod sursa (job #662250)
Cod sursa(job #662250)
#include <fstream>
using namespace std;
const int N=100005;
int n,m,v[N],op,x;
int caut0()
{
int s=1,p=n,mij=(s+p)/2;
while(s<=p && v[mij]!=x)
{
mij=(s+p)/2;
if(v[mij]<x)
s=mij+1;
else
p=mij-1;
}
while(v[mij]==x)
mij++;
if(v[mij-1]==x)
return mij-1;
else
return -1;
}
int caut1()
{
int s=1,p=n,mij;
while(s<=p)
{
mij=(s+p)/2;
if(v[mij]>x)
p=mij-1;
else
if(v[mij+1]>x)
return mij;
else
s=mij+1;
}
return mij;
}
int caut2()
{ int s=1,p=n,mij;
while(s<=p)
{
mij=(s+p)/2;
if(v[mij]>=x)
{if(v[mij-1]<x)
return mij;
else
p=mij-1;}
else
s=mij+1;
}
}
int main()
{
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 j=1;j<=m;j++)
{
f>>op>>x;
if(op==0)
g<<caut0()<<"\n";
else
if(op==1)
g<<caut1()<<"\n";
else
if(op==2)
g<<caut2()<<"\n";
}
return 0;
}