algzjh的博客

///一维RMQ-求最大值#include<iostream>#include<cstdio>#include<queue>#include<set>#include<cstring>#include<vector>#include<algorithm>using namespace std;typedef long long LL;const int MAXN=5e4+5;i

F[i,j]F[i,j]F[i,j]表示数列AAA中下标在子区间[i,i+2j−1][i,i+2j−1][i,i+2^j-1]里数的最大值，也就是从iii开始的2j2j2^j个数的最大值。 F[i,0]=A[i]F[i,0]=A[i]F[i,0]=A[i] F[i,j]=max(F[i,j−1],F[i+2j−1,j−1])F[i,j]=max(F[i,j−1],F[i+2j−1,j−1])F...