Cod sursa(job #3151910)
| Utilizator | Data | 23 septembrie 2023 08:38:58 | |
|---|---|---|---|
| Problema | Cautare binara | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.65 kb |
#include <iostream>
using namespace std;
int n,v[100001];
int f0(int x){
int i=n;
while(i>=1 && x!=v[i])
i--;
return i;
}
int f1(int x){
int i=1;
while(i<=n && v[i]<=x)
i++;
return i-1;
}
int f2(int x){
int i=1;
while(i<=n && v[i]<x)
i++;
return i;
}
int main()
{
int i,m,q,x;
cin>>n;
for(i=1; i<=n; i++)
cin>>v[i];
cin>>m;
for(i=1; i<=m; i++){
cin>>q>>x;
if(q==0)
cout<<f0(x)<<"\n";
if(q==1)
cout<<f1(x)<<"\n";
if(q==2)
cout<<f2(x)<<"\n";
}
return 0;
}
