Pagini recente » Cod sursa (job #1250615) | Cod sursa (job #2690281) | Cod sursa (job #2283585) | Cod sursa (job #2758738) | Cod sursa (job #639618)
Cod sursa(job #639618)
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("cautbin.in");
ofstream out("cautbin.out");
int v[100001],n;
int caut0 (int x)
{
int i,pas=1<<16;
for(i=0;pas!=0; pas/=2)
if(i+pas<=n && v[i+pas]<=x)
i+=pas;
if(v[i]== x)
return i;
return -1;
}
int caut1 (int x)
{
int i,pas=1<<16;
for(i=0;pas!=0; pas/=2)
if(i+pas<=n && v[i+pas]<=x)
i+=pas;
return i;
}
int caut2 (int x)
{
int i,pas=1<<16;
for(i=0; pas!=0; pas/=2)
if(i+pas<=n && v[i+pas]<x)
i+=pas;
return 1+i;
}
int main()
{
int m,x,i,h;
in>>n;
for(i=1; i<=n; i++)
in>>v[i];
in>>m;
for(i=1;i<=m;i++){
in>>h>>x;
if(h == 1)
out<<caut1(x)<<"\n";
if(h == 2)
out<<caut2(x)<<"\n";
if(h == 0)
out<<caut0(x)<<"\n";
}
return 0;
}