Pagini recente » Cod sursa (job #2625884) | Cod sursa (job #2861501) | Cod sursa (job #1937937) | Cod sursa (job #1604405) | Cod sursa (job #1146586)
#include<fstream>
using namespace std;
ifstream f("cautbin.in");
ofstream g("cautbin.out");
int n,v[100009],x,tip,l,st,m,mij;
int cautare(int x)
{
st=1;int dr=n;
while(st<=dr)
{
mij=(st+dr)/2;
if(v[mij]==x) return mij;
else if(v[mij]<x) st=mij+1;
else dr=mij-1;
}
return 0;
}
int main()
{
f>>n;
for(int i=1;i<=n;++i) f>>v[i];
f>>m;
for(int i=1;i<=m;++i)
{
f>>tip>>x;
if(tip==0)
{
cautare(x);
if(mij>0)
{
l=1;
while(v[mij]==v[mij+l]) l++;
g<<mij+l-1<<'\n';
}
else g<<-1<<'\n';
}
if(tip==1)
{
cautare(x);
if(mij>0)
{
l=1;
while(v[mij]==v[mij+l]) l++;
g<<mij+l-1<<'\n';
}
else g<<st<<'\n';
}
if(tip==2)
{
if(mij>0)
{
l=1;
while(v[mij]==v[mij-l]) l++;
g<<mij-l+1<<'\n';
}
else g<<st<<'\n';
}
}
f.close();g.close();
return 0;
}