Pagini recente » Cod sursa (job #2318786) | Cod sursa (job #1412049) | Cod sursa (job #2811807) | Cod sursa (job #47224) | Cod sursa (job #2782233)
#include <iostream>
#include <vector>
using namespace std;
int main()
{
int n , m ;
cin>> n ;
vector<int> v(n + 1 , 0) ;
for (int i = 1 ; i <= n ; i ++){
cin>> v[i] ;
}
cin>> m ;
for (int i = 1 ; i <= m ; i ++){
int nrc , nr , c = 1 , f , mij;
cin>> nrc >> nr ;
if (nrc <= 1){
while (f - c != 1) {
m = (c + f) / 2 ;
if (k >= v[m])
c = m ;
else
f = m ;
}
if (nrc == 1)
if(v[f] <= nr)
cout<< f <<endl ;
else
cout<< c <<endl ;
else
if (v[f] == nr)
cout<< f <<endl ;
else
cout<< -1 <<endl ;
}
else{
while (f - c != 1) {
m = (c + f) / 2 ;
if (k <= v[m])
f = m ;
else
c = m ;
}
if(v[f] <= nr)
cout<< f <<endl ;
else
cout<< c <<endl ;
}
}
return 0;
}