Pagini recente » Cod sursa (job #551382) | Cod sursa (job #3199531) | Cod sursa (job #2145071) | Cod sursa (job #1880868) | Cod sursa (job #1366224)
#include <fstream>
using namespace std;
ifstream fin("cautbin.in");
ofstream fout("cautbin.out");
int x, n, i, M, ls, ld, mij, poz,l,nr, v[100050];
int main()
{
fin>>n;
for(i=1; i<=n; i++)
{
fin>>v[i];
}
fin>>M;
for(l=1; l<=M; l++)
{
fin>>x;
if(x==0)
{
fin>>nr;
ls=1;
poz=-1;
ld=n;
while(ls<=ld and poz==-1)
{
mij=(ls+ld)/2;
if(nr==v[mij] and v[mij+1]!=nr)
poz=mij;
else if(nr<v[mij])
ld=mij-1;
else if(nr>v[mij])
ls=mij+1;
else if(nr==v[mij])
ls=mij;
}
fout<<poz<<" ";
}
else if(x==1)
{
fin>>nr;
ls=1;
poz=-1;
ld=n;
while(ls<=ld and poz==-1)
{
mij=(ls+ld)/2;
if(nr>=v[mij] and v[mij+1]>nr)
poz=mij;
else if(nr<v[mij])
ld=mij-1;
else if(nr>v[mij])
ls=mij+1;
else if(nr==v[mij])
ls=mij;
}
fout<<poz<<" ";
}
else if(x==2)
{
fin>>nr;
ls=1;
poz=-1;
ld=n;
while(ls<=ld and poz==-1)
{
mij=(ls+ld)/2;
if(nr<=v[mij] and v[mij-1]<nr)
poz=mij;
else if(nr<v[mij])
ld=mij-1;
else if(nr>v[mij])
ls=mij+1;
else if(nr==v[mij])
ld=mij;
}
fout<<poz<<" ";
}
}
return 0;
}