Cod sursa(job #1727900)
Utilizator | Data | 11 iulie 2016 20:58:06 | |
---|---|---|---|
Problema | Cautare binara | Scor | 40 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.56 kb |
#include <iostream>
#include <fstream>
using namespace std;
int N,M,v[100000],i,x,t,j,k;
int main()
{ ifstream f("cautbin.in");
ofstream g("cautbin.out");
f>>N;
for(i=1;i<=N;i++)
f>>v[i];
f>>M;
for(j=1;j<=M;j++){
f>>t>>x;
k=0;
if(t==0){
for(i=N;i>=1;i--)
if(v[i]==x) {k=1;g<<i<<endl;break;}
if(k==0) g<<k-1<<endl;
}
if(t==1)
for(i=N;i>=1;i--)
if(v[i]<=x) {g<<i<<endl;break;}
if(t==2)
for(i=1;i<=N;i++)
if(v[i]>=x) {g<<i<<endl;break;}
}
}