Cod sursa(job #1423723)
Utilizator | Data | 22 aprilie 2015 14:11:09 | |
---|---|---|---|
Problema | Cautare binara | Scor | 40 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.83 kb |
#include <fstream>
using namespace std;
ifstream in("cautbin.in");
ofstream out("cautbin.out");
int n,i,mid,x,tip,a[100005];
int main()
{
in>>n;
for(i=1;i<=n;i++)
in>>a[i];
in>>mid;
while(mid--)
{
in>>tip>>x;
switch(tip)
{
case 0: for(i=1;i<=n && a[i]<=x;i++);
i--;
if(a[i]==x) out<<i<<'\n';
else out<<"-1\n";
break;
case 1: for(i=1;i<=n && a[i]<=x;i++);
i--; out<<i<<'\n';
break;
case 2: for(i=1;i<=n && a[i]<x;i++);
out<<i<<'\n';
break;
}
}
out.close();
return 0;
}