Pagini recente » Cod sursa (job #3265040) | Planificare infoarena | Cod sursa (job #3157940) | Cod sursa (job #3294047) | Cod sursa (job #1884090)
#include <iostream>
#include <fstream>
#include <vector>
#include <algorithm>
using namespace std;
ifstream in("cautbin.in");
ofstream out("cautbin.out");
void answer(vector<int> &elements,int question,int number){
vector<int>::iterator it;
if(question == 0){
it = upper_bound(elements.begin(),elements.end(),number);
if(*it == number)
out << ( it - elements.begin()) <<endl;
else
out << "-1" << endl;
}
else
if(question == 1){
it = lower_bound(elements.begin(),elements.end(),number + 1);
out << (it - elements.begin()) << endl;
}
else
if(question == 2){
it = upper_bound(elements.begin(),elements.end(),number-1);
out << (it - elements.begin()) << endl;
}
}
int main() {
int n,m;
int elem;
int question;
int number;
vector<int> elements;
in >> n;
for(int i = 0; i < n; i++)
{
in >> elem;
elements.push_back(elem);
}
in >> m;
for(int i = 0; i < m; i++)
{
in >> question >> number;
answer(elements,question,number);
}
return 0;
}