Pagini recente » Cod sursa (job #1821151) | Cod sursa (job #45984) | Cod sursa (job #2179864) | Cod sursa (job #1648541) | Cod sursa (job #1844301)
#include <iostream>
#include <fstream>
using namespace std;
long long N, M, j;
int i, nr, x, v[100], c;
int main () {
ifstream fin("cautbin.in");
ofstream fout("cautbin.out");
fin >> N;
for (i = 1; i <= N; i++) fin >> v[i];
fin >> M;
for (i = 1; i <= M; i++)
{
fin >> c >> x;
if (c == 0)
{
j = N;
while (v[j] != x && j >= 1) j--;
if (j >= 1) fout << j << "\n";
else fout << -1 << "\n";
}
if (c == 1)
{
j = N;
while (v[j] > x && j >= 1) j--;
fout << j << "\n";
}
if (c == 2)
{
j = 1;
while (v[j] < x && j <= N) j++;
fout << j << "\n";
}
}
}