Cod sursa(job #1603155)
Utilizator | Data | 17 februarie 2016 11:25:47 | |
---|---|---|---|
Problema | Cautare binara | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 1.12 kb |
#include <fstream>
#include <iostream>
using namespace std;
ifstream fin("cautbin.in");
ofstream fout("cautbin.out");
int x[100001];
int main()
{
int n, m, a, i, j, p, y;
fin>>n;
for(i=1;i<=n;i++)
{
fin>>x[i];
}
fin>>m;
for(j=1;j<=m;j++)
{
fin>>p>>a;
if(p)
{
if(p==1)
{
for(i=n;i>=1;i--)
{
if(x[i]<=a)
{
fout<<i;
i=0;
}
}
}
else
{
for(i=1;i<=n;i++)
{
if(x[i]>=a)
{
fout<<i;
i=n+1;
}
}
}
}
else
{
for(i=n;i>=1;i--)
{
if(x[i]==a)
{
fout<<i;
i=0;
}
}
}
}
return 0;
}