数据结构--RMQ
exmy
Less is more, and more is less.
展开
-
poj--3264 Balanced Lineup(RMQ)
poj 3264题解RMQ练手。#include <iostream> #include <cstdio> #include <cmath> #include <algorithm> using namespace std;const int maxn = 50000 + 10; int ax[maxn][20], in[maxn][20]; int n, q;void RMQ() {原创 2016-03-19 22:01:03 · 362 阅读 · 0 评论 -
nyoj--119 士兵杀敌(三)(RMQ)
nyoj 119题解区间最值查询,RMQ模型。#include <iostream> #include <cstdio> #include <cmath> #include <algorithm> using namespace std;const int maxn = 100000 + 10; int maxnum[maxn][17], minnum[maxn][17]; //2^17 = 1原创 2016-03-07 21:33:44 · 478 阅读 · 0 评论