Pagini recente » Cod sursa (job #2126465) | Cod sursa (job #2791241) | Cod sursa (job #3285180) | Cod sursa (job #280736) | Cod sursa (job #2173727)
#include <bits/stdc++.h>
#define for0(i,n) for(int i=0; i<n; i++)
#define for1(i,n) for(int i=1; i<=n; i++)
#define pb push_back
#define mp make_pair
#define all(v) v.begin(), v.end()
#define V vector<int>
#define VP vector<pair<int, int> >
#define clr(A,x) memset(A, x, sizeof(A))
#define cpy(A,B) memcpy(A, B, sizeof(B))
#define g(s) getline(cin, s) ///ai grija la fin/cin ///
#define FASTIO ios_base::sync_with_stdio(0)
#define INF 0x3f3f3f3f
typedef long long ll;
typedef unsigned long long ull;
using namespace std;
//ifstream fin("arbxyz.in"); /// modifica cu numele corespunzator
//ofstream fout("arbxyz.out"); /// modifica cu numele corespunzator
const int CHARMAX = (1 << 10);
class InParsare
{
private:
FILE *fin;
char *buffer;
size_t index_of_buffer;
char read_character()
{
index_of_buffer++;
if(index_of_buffer == CHARMAX)
{
fread(buffer, 1, CHARMAX, fin);
index_of_buffer = 0;
}
return buffer[index_of_buffer];
}
public:
InParsare(const char *name)
{
fin = fopen(name, "r");
buffer = new char[CHARMAX]();
index_of_buffer = CHARMAX - 1;
}
template<class T>
InParsare &operator >> (T &n)
{
char c;
while(!isdigit(c = read_character()) && c != '-');
int sgn = 1;
if(c == '-')
{
n = 0;
sgn = -1;
}
else n = c - '0';
while(isdigit(c = read_character()))
n = n * 10 + c - '0';
return *this;
}
};
class OutParsare
{
private:
FILE *fout;
char *buffer;
size_t index_of_buffer;
void write_character(char character)
{
if(index_of_buffer == CHARMAX)
{
fwrite(buffer, 1, CHARMAX, fout);
index_of_buffer = 0;
buffer[index_of_buffer++] = character;
}
else buffer[index_of_buffer++] = character;
}
public:
OutParsare(const char *name)
{
fout = fopen(name, "w");
buffer = new char[CHARMAX]();
index_of_buffer = 0;
}
~OutParsare()
{
fwrite(buffer, 1, index_of_buffer, fout);
fclose(fout);
}
template<class T>
OutParsare &operator << (T n)
{
if(typeid(T).name() == typeid(char).name())
{
write_character(n);
return *this;
}
if(n <= 9)
write_character(n + '0');
else
{
(*this) << (n / 10);
write_character(n % 10 + '0');
}
return *this;
}
};
//InParsare fin("rmq.in"); /// merg numai pt numere
//OutParsare fout("rmq.out"); /// merg numai pt numere + caractere individuale, nu stringuri
const int NMAX = 100001, LOGMAX = 18;
int n, q;
int lg[NMAX], rmq[LOGMAX][NMAX];
int main()
{
freopen("rmq.in", "r", stdin);
freopen("rmq.out", "w", stdout);
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin >> n >> q;
for(int i = 2; i <= n; i++)
lg[i] = lg[i / 2] + 1;
for1(i, n)
cin >> rmq[0][i];
for(int i = 1; (1 << i) <= n; i++)
for(int j = 1; j <= n - (1 << i) + 1; j++)
rmq[i][j] = min(rmq[i - 1][j], rmq[i - 1][j + (1 << (i - 1))]);
for1(nrquey, q)
{
int l, r;
cin >> l >> r;
int putere = lg[r - l + 1];
cout << min(rmq[putere][l], rmq[putere][r - (1 << putere) + 1]) << '\n';
}
return 0;
}