Pagini recente » Cod sursa (job #2152082) | Cod sursa (job #2908381) | Cod sursa (job #1101785) | Cod sursa (job #1825312) | Cod sursa (job #2461338)
#include <fstream>
using namespace std;
ifstream in ("cautbin.in");
ofstream out ("cautbin.out");
int v[100005];
int x;
int n,mm,m;
int cautare(int x)
{
int st,dr,i;
st=0;
dr=n-1;
while(st<=dr)
{
m=(st+dr)/2;
if(x==v[m])
{
if(v[m+1]>v[m])
return m+1;
else
{
for(i=m+1;i<n;i++)
{
if(v[i+1]>v[i])
return v[i]+1;
}
}
}
if(x>=v[m])
{
dr=m-1;
}
else{
st=m+1;
}
}
return -1;
}
int cautare1(int x)
{
int st,dr,i;
st=0;
dr=n-1;
while(st<=dr)
{
m=(st+dr)/2;
if(x>=v[m])
{
if(v[m+1]>v[m])
return m+1;
else
{
for(i=m+1;i<n;i++)
{
if(v[i+1]>v[i])
return v[i]+1;
}
}
}
if(x>=v[m])
{
dr=m-1;
}
else{
st=m+1;
}
}
return 0;
}
int cautare2(int x)
{
int st,dr,i;
st=0;
dr=n-1;
while(st<=dr)
{
m=(st+dr)/2;
if(x>=v[m])
{
if(v[m-1]<v[m])
return m+1;
else
{
for(i=m-1;i>=0;i--)
{
if(v[i-1]<v[i])
return i+1;
}
}
}
if(x>=v[m])
{
dr=m-1;
}
else{
st=m+1;
}
}
return 0;
}
int main()
{
int i,x,e;
in>>n;
for(i=0;i<=n-1;i++)
{
in>>v[i];
}
in>>mm;
for(i=1;i<=mm;i++)
{
in>>e>>x;
if(e==0)
{
out<<cautare(x)<<'\n';
}
if(e==1)
{
out<<cautare1(x)<<'\n';
}
if(e==2)
{
out<<cautare2(x)<<'\n';
}
}
return 0;
}