Nu aveti permisiuni pentru a descarca fisierul grader_test4.ok
Cod sursa(job #2066075)
| Utilizator | Data | 14 noiembrie 2017 18:07:05 | |
|---|---|---|---|
| Problema | Cautare binara | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 1.21 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream in ("cautbin.in");
ofstream out ("cautbin.out");
const int N=100001,L=16;
int n ,v[N];
int caut_bin0(int x)
{
int pas = 1<<L, r=0;
while ( pas!=0)
{
if( pas+r <= n && v[r+pas] <= x)
{
r+=pas;
}
pas/=2;
}
if(v[r]!=x)
return -1;
else return r ;
}
int caut_bin2(int x)
{
int pas = 1<<L, r=0;
while ( pas!=0 )
{
if(pas+r <= n && v[r+pas] < x)
{
r+= pas;
}
pas/=2;
}
return r+1;
}
int caut_bin1 (int x)
{
int pas = 1<<L, r=0;
while ( pas!=0)
{
if( pas+r <= n && v[r+pas] <= x)
{
r+=pas;
}
pas/=2;
}
return r ;
}
int main()
{
int i,x,m,y;
in>>n;
for(i=1; i<=n; i++)
in>>v[i];
in>>m;
while(m!=0)
{
in>>y;
in>>x;
if(y==0)
out<<caut_bin0(x)<<"\n";
else
{
if(y==1)
out<<caut_bin1(x)<<"\n" ;
else out<<caut_bin2(x)<<"\n" ;
}
m--;
}
return 0;
}
