Cod sursa(job #2284660)
| Utilizator | Data | 17 noiembrie 2018 12:22:56 | |
|---|---|---|---|
| Problema | Cautare binara | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 1.05 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("cautbin.in");
ofstream g("cautbin.out");
int main()
{
int v[101],i,x,j,n,y,poz,exista,OK,m;
f>>n;
for(i=1;i<=n;i++)
f>>v[i];
f>>m;
for(j=1;j<=m;j++)
{
f>>y>>x;
if(y==0)
{
for(i=1;i<=n;i++)
if(v[i]==x)
{
poz=i;
exista=1;
}
if(exista==1)
g<<poz;
else
g<<-1;
}
if(y==1)
{
OK=1;
i=n;
while(OK!=0)
{
if(v[i]<=x)
{
poz=i;
OK=0;
}
i--;
}
g<<poz;
}
if(y==2)
{
for(i=n;i>=1;i--)
if(v[i]>=x)
poz=i;
g<<poz;
}
g<<endl;
}
return 0;
}
