洛谷P2880 [USACO07JAN]平衡的阵容Balanced Lineup 题解

题目链接:

https://www.luogu.org/problemnew/show/P2880

分析:

ST表实现即可,一个最大值数组和最小值数组同时维护

代码:

#include
#include
#include
#include
using namespace std;
int LOG2[50005],POW2[50005],f[50005][30],g[50005][30];
int query(int l,int r)
{
    int p=LOG2[r-l+1];
    return (max(f[l][p],f[r-POW2[p]+1][p])-min(g[l][p],g[r-POW2[p]+1][p]));
}
int main()
{
//  cout<

你可能感兴趣的:(洛谷P2880 [USACO07JAN]平衡的阵容Balanced Lineup 题解)