巫师的总力量和

/*
 * 思路：
 * 利用Java Stream API来处理数组。通过流的方式生成所有可能的子数组，并计算每个子数组的最小值和总和，
 * 然后将它们的乘积加到总力量值中。为了防止结果溢出，需要对结果取模。
 */
import java.util.*;
import java.util.stream.IntStream;

public class WizardStrengthStream {
    public static int totalStrength(int[] strength) {
        int MOD = 1000000007;
        long total = IntStream.range(0, strength.length)
                .mapToLong(i -> IntStream.range(i, strength.length)
                        .mapToObj(j -> Arrays.stream(Arrays.copyOfRange(strength, i, j + 1)))
                        .flatMapToLong(subArray -> {
                            int minStrength = subArray.min().orElse(0);
                            long sum = subArray.sum();
                            return LongStream.of((long) minStrength * sum);
                        })
                        .sum())
                .reduce(0L, (a, b) -> (a + b) % MOD);
        return (int) total;
    }

    public static void main(String[] args) {
        int[] strength1 = {1, 3, 1, 2};
        int[] strength2 = {5, 4, 6};
        System.out.println(totalStrength(strength1)); // 44
        System.out.println(totalStrength(strength2)); // 213
    }
}