Pagini recente » Monitorul de evaluare | Cod sursa (job #1065639) | Cod sursa (job #1890874)
#include <iostream>
#include <fstream>
#include <vector>
#include <algorithm>
#include <ctime>
#include <sstream>
using namespace std;
ifstream in("cautbin.in");
ofstream out("cautbin.out");
void answer_0(vector<int> &elements, int number){
vector<int>::iterator it = upper_bound(elements.begin(),elements.end(),number - 1);
if(*it == number){
out << (it - elements.begin() + 1) << endl;
return;
}
else{
out << "-1"<<endl;
return;
}
}
void answer_1(vector<int> &elements, int number){
vector<int>::iterator it = lower_bound(elements.begin(),elements.end(),number + 1);
out << (it - elements.begin()) << endl;
}
void answer_2(vector<int> &elements, int number){
vector<int>::iterator it = upper_bound(elements.begin(),elements.end(),number - 1);
out << (it - elements.begin() + 1) << endl;
}
void answer(vector<int> &elements,int question,int number){
if (question == 0) {
answer_0(elements,number);
return;
} else if (question == 1) {
answer_1(elements,number);
return;
} else {
answer_2(elements,number);
return;
}
}
int main() {
int n,m;
int question;
int number;
vector<int> elements;
string elementsAsString;
in >> n;
ws(in);
getline(in,elementsAsString);
stringstream str(elementsAsString);
while( str >> number)
elements.push_back(number);
in >> m;
for(int i = 0; i < m; i++)
{
in >> question >> number;
answer(elements,question,number);
}
return 0;
}