3640. Trionic Array II Hard

1/**
2 * [3640] Trionic Array II
3 *
4 * <p data-end="191" data-start="0">You are given an integer array <code data-end="61" data-start="55">nums of length <code data-end="75" data-start="72">n.
5 * <p data-end="191" data-start="0">A <strong data-end="99" data-is-only-node="" data-start="79">trionic subarray is a contiguous subarray <code data-end="136" data-start="125">nums[l...r] (with <code data-end="158" data-start="143">0 <= l < r < n) for which there exist indices l < p < q < r such that:
6 * 
7 * 	<li data-end="267" data-start="230"><code data-end="241" data-start="230">nums[l...p] is strictly increasing,
8 * 	<li data-end="307" data-start="270"><code data-end="281" data-start="270">nums[p...q] is strictly decreasing,
9 * 	<li data-end="347" data-start="310"><code data-end="321" data-start="310">nums[q...r] is strictly increasing.
10 * 
11 * <p data-end="609" data-is-last-node="" data-is-only-node="" data-start="349">Return the maximum sum of any trionic subarray in <code data-end="417" data-start="411">nums.
12 *  
13 * <strong class="example">Example 1:
14 * <div class="example-block">
15 * Input: <span class="example-io">nums = [0,-2,-1,-3,0,2,-1]</span>
16 * Output: <span class="example-io">-4</span>
17 * Explanation:
18 * <p data-end="129" data-start="72">Pick <code data-end="99" data-start="92">l = 1, <code data-end="108" data-start="101">p = 2, <code data-end="117" data-start="110">q = 3, <code data-end="126" data-start="119">r = 5:
19 * 
20 * 	<li data-end="203" data-start="132"><code data-end="166" data-start="132">nums[l...p] = nums[1...2] = [-2, -1] is strictly increasing (<code data-end="200" data-start="191">-2 < -1).
21 * 	<li data-end="277" data-start="206"><code data-end="240" data-start="206">nums[p...q] = nums[2...3] = [-1, -3] is strictly decreasing (<code data-end="274" data-start="265">-1 > -3)
22 * 	<li data-end="396" data-start="280"><code data-end="316" data-start="280">nums[q...r] = nums[3...5] = [-3, 0, 2] is strictly increasing (<code data-end="353" data-start="341">-3 < 0 < 2).
23 * 	<li data-end="396" data-start="280">Sum = (-2) + (-1) + (-3) + 0 + 2 = -4.
24 * </div>
25 * <strong class="example">Example 2:
26 * <div class="example-block">
27 * Input: <span class="example-io">nums = [1,4,2,7]</span>
28 * Output: <span class="example-io">14</span>
29 * Explanation:
30 * <p data-end="519" data-start="462">Pick <code data-end="489" data-start="482">l = 0, <code data-end="498" data-start="491">p = 1, <code data-end="507" data-start="500">q = 2, <code data-end="516" data-start="509">r = 3:
31 * 
32 * 	<li data-end="589" data-start="522"><code data-end="554" data-start="522">nums[l...p] = nums[0...1] = [1, 4] is strictly increasing (<code data-end="586" data-start="579">1 < 4).
33 * 	<li data-end="659" data-start="592"><code data-end="624" data-start="592">nums[p...q] = nums[1...2] = [4, 2] is strictly decreasing (<code data-end="656" data-start="649">4 > 2).
34 * 	<li data-end="754" data-is-last-node="" data-start="662"><code data-end="694" data-start="662">nums[q...r] = nums[2...3] = [2, 7] is strictly increasing (<code data-end="726" data-start="719">2 < 7).
35 * 	<li data-end="754" data-is-last-node="" data-start="662">Sum = 1 + 4 + 2 + 7 = 14.
36 * </div>
37 *  
38 * Constraints:
39 * 
40 * 	<li data-end="883" data-start="851"><code data-end="881" data-start="851">4 <= n = nums.length <= 10^5
41 * 	<li data-end="914" data-start="886"><code data-end="912" data-start="886">-10^9 <= nums[i] <= 10^9
42 * 	<li data-end="978" data-is-last-node="" data-start="917">It is guaranteed that at least one trionic subarray exists.
43 * 
44 */
45pub struct Solution {}
46
47// problem: https://leetcode.com/problems/trionic-array-ii/
48// discuss: https://leetcode.com/problems/trionic-array-ii/discuss/?currentPage=1&orderBy=most_votes&query=
49
50// submission codes start here
51
52impl Solution {
53    pub fn max_sum_trionic(nums: Vec<i32>) -> i64 {
54        
55    }
56}
57
58// submission codes end
59
60#[cfg(test)]
61mod tests {
62    use super::*;
63
64    #[test]
65    fn test_3640() {
66    }
67}
68