Pagini recente » Cod sursa (job #1651165) | Clasament urmasiiluidoru | Cod sursa (job #641239) | Cod sursa (job #2555666) | Cod sursa (job #957691)
Cod sursa(job #957691)
#include <iostream>
#include <fstream>
using namespace std;
int main ()
{
int a[100],i,j,x,c,m,n,ok,p,u,s;
ifstream fin("cautbin.in");
ofstream fout("cautbin.out");
fin>>n;
for (i=1;i<=n;i++)
fin>>a[i];
fin>>s;
for (i=1;i<=s;i++)
{
fin>>c>>x;
if (c==0)
{
p=1;u=n;
while (p+1<u)
{
m=(p+u)/2;
if (x<a[m])
u=m-1;
if (x>a[m])
p=m+1;
if (x==a[m])
p=m;
}
if (u!=n)
fout<<p<<'\n';
else
fout<<-1<<'\n';
}
if (c==1)
{
p=1;u=n;
while (p+1<u)
{
m=(p+u)/2;
if (x<a[m])
u=m-1;
if (x>a[m])
p=m+1;
if (x==a[m])
p=m;
}
fout<<p<<'\n';
}
if (c==2)
{
p=1;u=n;
while (p+1<u)
{
m=(p+u)/2;
if (x<a[m])
u=m;
if (x>a[m])
p=m+1;
if (x==a[m])
u=m;
}
fout<<u;
}
}
fin.close();
fout.close();
return 0;
}