Pagini recente » Cod sursa (job #1120886) | Cod sursa (job #2905939) | Cod sursa (job #892197) | Cod sursa (job #2059278) | Cod sursa (job #1596639)
#include <fstream>
using namespace std;
ifstream in("cautbin.in");
ofstream out("cautbin.out");
int v[100000];
int n;
int izbavirea(int x)
{
int st=1,dr=n,mij;
while(st<=dr)
{
mij=(st+dr)/2;
if(v[mij]<=x)st=mij+1;
else dr=mij-1;
}
return dr;
}
int crucifix(int x)
{
int st=1,dr=n,mij;
while(st<=dr)
{
mij=(st+dr)/2;
if(v[mij]==x)st=mij+1;
else ;
}
return -1;
}
int jesus(int x)
{
int st=1,dr=n,mij;
while(st<=dr)
{
mij=(st+dr)/2;
if(v[mij]>=x)st=mij+1;
else dr=mij-1;
}
return st;
}
int main()
{
ios_base::sync_with_stdio(false);
int m,i,cz,ind;
in>>n;
for(i=1;i<=n;i++)
in>>v[i];
in>>m;
while(m>0)
{
in>>cz;
in>>ind;
if(cz==0)
out<<crucifix(ind);
if(cz==1)
out<<izbavirea(ind);
if(cz==2)
out<<jesus(ind);
out<<'\n';
m--;
}
return 0;
}