Pagini recente » Cod sursa (job #2571151) | Cod sursa (job #1244885) | Cod sursa (job #1994208) | Cod sursa (job #1742036) | Cod sursa (job #2782687)
#include <iostream>
#include <vector>
#include <fstream>
using namespace std;
ifstream in ("cautbin.in") ;
ofstream out ("cautbin.out") ;
int main()
{
int n , m ;
in>> n ;
vector<long long int> v(n + 1 , 0) ;
for (int i = 1 ; i <= n ; i ++){
in>> v[i] ;
}
in>> m ;
for (int i = 1 ; i <= m ; i ++){
int nrc , nr , c = 1 , f = n , mij;
in>> nrc >> nr ;
if (nrc <= 1){
while (f - c > 1) {
mij = (c + f) / 2 ;
if (nr >= v[mij]){
c = mij ;
}
else{
f = mij ;
}
}
if (nrc == 1){
if(v[f] <= nr){
out<< f <<endl ;
}
else{
out<< c <<endl ;
}
}
else{
if (v[f] == nr){
out<< f <<endl ;
}
else{
if (v[c] == nr){
out<< c <<endl ;
}
else{
out<< -1 <<endl ;
}
}
}
}
else{
while (f - c > 1) {
mij = (c + f) / 2 ;
if (nr <= v[mij])
f = mij ;
else
c = mij ;
}
if(v[c] >= nr){
out<< c <<endl ;
}
else{
out<< f <<endl ;
}
}
}
return 0;
}