Mai intai trebuie sa te autentifici.
Cod sursa(job #879990)
Utilizator | Data | 16 februarie 2013 09:31:54 | |
---|---|---|---|
Problema | Cautare binara | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 1.03 kb |
#include <fstream>
using namespace std;
ifstream in("cautbin.in");
ofstream out ("cautbin.out");
int const N=100001;
int v[N],n;
int caut0(int x)
{
int i=0, pas=1<<30;
while (pas!=0)
{
if (i+pas<=n && v[i+pas]<=x)
i+=pas;
pas/=2;
}
if (v[i]==x)
return i;
else return -1;
}
int caut1 (int x)
{
int i=0, pas=1<<30;
while (pas!=0)
{
if (i+pas<=n && v[i+pas]<=x)
i+=pas;
pas/=2;
}
return i;
}
int caut2 (int x)
{
int i=0, pas=1<<30;
while (pas!=0)
{
if (i+pas<=n && v[i+pas]<x)
i+=pas;
pas/=2;
}
return i+1;
}
int main()
{
int i, m, c, x;
in>>n;
for (i=1; i<=n; i++)
in>>v[i];
in>>m;
for (i=1; i<=m; i++)
{
in>>c>>x;
if (c==0)
out<<caut0(x);
if (c==1)
out<<caut1(x);
if (c==2)
out<<caut2(x);
out<<"\n";
}
return 0;
}