Pagini recente » Cod sursa (job #1480301) | Cod sursa (job #1395706) | Cod sursa (job #1214511) | Cod sursa (job #562191) | Cod sursa (job #1059202)
#include <fstream>
using namespace std;
ifstream f("cautbin.in");
ofstream g("cautbin.out");
int v[100001],n;
int caut0(int x)
{
int pas=1<<16,i=0;
while (pas!=0)
{
if(i+pas<=n && v[i+pas]<=x)
i+=pas;
pas/=2;
}
if(v[i]!=x) return -1;
return i;
}
int caut1 (int x)
{
int pas=1<<16,i=0;
while (pas!=0)
{
if(i+pas<=n && v[i+pas]<=x)
i+=pas;
pas/=2;
}
return i;
}
int caut2 (int x) {
int pas=1<<16,i=0;
while (pas!=0){
if(i+pas<=n && v[i+pas]<x)
i+=pas;
pas/=2;
}
return 1+i;
}
int main()
{
int m,i,c,y;
f>>n;
for(i=1; i<=n; i++)
f>>v[i];
f>>m;
for(i=1; i<=m; i++)
{
f>>c>>y;
if(c==0)
g << caut0(y) << "\n";
if(c==1)
g << caut1(y) << "\n";
if(c==2)
g << caut2(y) << "\n";
}
}