Cod sursa(job #1347981)
| Utilizator | Data | 19 februarie 2015 13:33:29 | |
|---|---|---|---|
| Problema | Cautare binara | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.96 kb |
#include <fstream>
using namespace std;
ifstream f("cautbin.in");
ofstream g("cautbin.out");
int n,a[100000],m;
void cit()
{
int i,k=0,j,x,y;
f>>n;
for(i=1;i<=n;i++)
f>>a[i];
f>>m;
for(i=1;i<=m;i++)
{
f>>x>>y;
if(x==0)
{
for(j=1;j<=n;j++)
if(a[j]==y)
k=j;
if(k!=0)
g<<k<<'\n';
else
g<<'-1'<<'\n';
k=0;
}
else
if(x==1)
{
for(j=1;j<=n;j++)
if(a[j]<=y)
k=j;
if(k!=0)
g<<k<<'\n';
k=0;
}
else
if(x==2)
{
for(j=1;j<=n;j++)
if(a[j]>=y)
{
k=j;
break;
}
if(k!=0)
g<<k;
k=0;
}
}
}
int main()
{
cit();
return 0;
}
