Mai intai trebuie sa te autentifici.
Cod sursa(job #201528)
Utilizator | Data | 1 august 2008 11:58:23 | |
---|---|---|---|
Problema | Cautare binara | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.65 kb |
#include<stdio.h>
#include<stdlib.h>
#define NMAX 200000
#define MMAX 200000
struct qry{int tip,x;};
int v[NMAX],n,m;
qry w[MMAX];
int main(){
freopen("cautbin.in","r",stdin);
freopen("cautbin.out","w",stdout);
scanf("%d",&n);
int i,j,r;
for(i=0;i<n;i++) scanf("%d",&v[i]);
scanf("%d",&m);
for(j=0;j<m;j++) scanf("%d%d",&w[j].tip,&w[j].x);
for(j=0;j<m;j++){
r=-1;
switch(w[j].tip){
case 0: for(i=0;i<n;i++)
if(w[j].x==v[i]) {r=i+1;break;}
break;
case 1: for(i=0;i<n;i++)
if(v[i]>w[j].x) {r=i;break;}
break;
case 2: for(i=0;i<n;i++)
if(v[i]>=w[j].x) {r=i+1;break;}
break;
}
printf("%d\n",r);
}
return 0;
}