Pagini recente » Cod sursa (job #2588869) | Cod sursa (job #1905637) | Cod sursa (job #1702538) | Cod sursa (job #291109) | Cod sursa (job #1644916)
#include <fstream>
using namespace std;
class InputReader
{
public:
InputReader() {}
InputReader(const char* file_name)
{
input_file = fopen(file_name,"r");
cursor = 0;
fread(buff,SIZE,1,input_file);
}
inline InputReader &operator >>(int& n)
{
n = 0;
while (buff[cursor] < '0' || buff[cursor] > '9')
advance();
while (buff[cursor] >= '0' && buff[cursor] <= '9') {
n = n * 10 + buff[cursor] - '0';
advance();
}
return *this;
}
private:
static const int SIZE = 1<<17;
int cursor;
FILE *input_file;
char buff[SIZE];
inline void advance() {
cursor++;
if (cursor == SIZE) {
cursor = 0;
fread(buff,SIZE,1,input_file);
}
}
};
int rmq[20][100005];
int n,m;
int log[100005];
int main()
{
InputReader fin = InputReader("rmq.in");
ofstream fout("rmq.out");
fin >> n >> m;
for (int i = 1; i <= n; i++)
fin >> rmq[0][i];
for (int i = 1, k = 0; i <= n; i++) {
if (1<<k+1 <= i) k++;
log[i] = k;
}
for (int i = 1; (1<<i) <= n; i++)
for (int j = 1; j + (1<<i) - 1 <= n; j++)
rmq[i][j] = min(rmq[i-1][j],rmq[i-1][j+(1<<(i-1))]);
int x,y,k;
for (int i = 1; i <= m; i++)
{
fin >> x >> y;
k = log[y-x+1];
fout << "d " << k << "\n";
fout << min(rmq[k][x],rmq[k][y-(1<<k)+1]) << "\n";
}
}