Pagini recente » Istoria paginii runda/nu_ca-i_minunat | Istoria paginii runda/igorj_7/clasament | Istoria paginii runda/allyoucancode2008/clasament | Cod sursa (job #834193) | Cod sursa (job #2473493)
#include <bits/stdc++.h>
#include <fstream>
using namespace std;
ifstream fin("rmq.in");
ofstream fout("rmq.out");
int main()
{
int n,m;
fin>>n>>m;
vector<int> nums(n);
for(int i = 0;i<n;i++) fin>>nums[i];
vector<int> log_table(n+1,0);
for(int i = 2;i<log_table.size();i++)
{
log_table[i]=log_table[i/2]+1;
}
vector<vector<int>> sparse_table(log_table.back()+1,vector<int>(nums.size()));
sparse_table[0]=nums;
for(int i = 1;i<sparse_table.size();i++)
{
for(int j = 0;j+(1<<i)<=nums.size();j++)
{
sparse_table[i][j] = min(sparse_table[i-1][j],sparse_table[i-1][j+(1<<(i-1))]);
}
}
while(m--)
{
int l,r;
fin>>l>>r;
l--;
int log = log_table[r-l];
int minimum = min(sparse_table[log][l],sparse_table[log][r-(1<<log)]);
fout<<minimum<<'\n';
}
return 0;
}