Pagini recente » Cod sursa (job #2484776) | Cod sursa (job #2528703) | Cod sursa (job #1896772) | Cod sursa (job #238617) | Cod sursa (job #1884133)
#include <iostream>
#include <fstream>
#include <vector>
#include <algorithm>
using namespace std;
ifstream in("cautbin.in");
ofstream out("cautbin.out");
void answer_0(vector<int> &elements, int number){
for(int i = elements.size() -1; i >= 0; i--)
if(elements[i] == number)
{
out << i + 1 << endl;
return;
}
out << "-1" << endl;
}
void answer_1(vector<int> &elements, int number){
for(int i = elements.size() - 1; i >= 0; i-- ){
if(elements[i] <= number)
{
out << i + 1 << endl;
return;
}
}
}
void answer_2(vector<int> &elements, int number){
for(int i = 0; i < elements.size(); i++ ){
if(elements[i] >= number)
{
out << i + 1 << endl;
return;
}
}
}
void answer(vector<int> &elements,int question,int number){
if (question == 0) {
answer_0(elements,number);
} else if (question == 1) {
answer_1(elements,number);
} else {
answer_2(elements,number);
}
}
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;
}