Mai intai trebuie sa te autentifici.
Cod sursa(job #2883331)
Utilizator | Data | 1 aprilie 2022 13:44:17 | |
---|---|---|---|
Problema | Cautare binara | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.55 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream f("cautbin.out");
ofstream g("cautbin.in.out");
int n,i,V[100005],m,a[100005],s,st,dr,poz,b[100005];
int main()
{
f>>n;
for(i=1;i<=n;i++)
f>>m;
for(i=1;i<=m;i++)
f>>s >>a[i];
for(i=1;i<=m;i++)
{
st=1;
dr=n;
poz=0;
while(st<=dr && poz==0)
{
m=(st+dr)/2;
if(b[m]==a[i])poz=m;
else if(b[m]<a[i])dr=m-1;
else st=m+i;
}
if(poz!=0)g<<poz;
}
}