Leetcode1856. Maximum Subarray Min-Product 前缀和/单调栈
以每个元素作为最小值的区间static const int MOD = 1e9 + 7;const int N = 1e5 + 10;typedef long long LL;int h[N], l[N], r[N], q[N];LL s[N];class Solution {public: int maxSumMinProduct(vector<int>& nums) { int n = nums.size(); // 构造前.