该博客讨论了CodeForces上的一道编程问题817D，涉及计算数组所有子序列的最大最小值之差的绝对值总和。博主解释了解题思路，即使用单调栈来维护以每个元素为最大值或最小值的区间，并指出在计算过程中需要注意避免重复计数的情况。
You are given an array a consisting of n elements. The imbalance value of some subsegment of this array is the difference between the maximum and minimum element from this segment. The imbalance value of the array is the sum of imbalance valuesof all subsegments of this array.
For example, the imbalance value of array [1, 4, 1] is 9, because there are 6different subsegments of this array:
- [1] (from index 1 to index 1), imbalance value is 0;
- [1, 4] (from index 1 to index 2), imbalance value is 3;
- [1, 4, 1] (from index 1 to index 3), imbalance value is 3;
- [4] (from index 2 to index 2), imbalance value is 0;
- [4, 1] (from index 2 to index 3), imbalance value is 3;
- [1] (from index 3 to index 3), imbalance value is 0;
You have to determine the imbalance value of the array a.
Input
最低0.47元/天 解锁文章
扫一扫
337
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
