Maximum ascending subarray sum

#[test]
fn t1() {
    let start = std::time::Instant::now();
    let val = Solution::max_ascending_sum(vec![10, 20, 30, 5, 10, 50]);
    let expected = 65;
    log_result!(val == expected, "t1", start, &expected, &val);
    assert_eq!(val, expected);
}

#[test]
fn t2() {
    let start = std::time::Instant::now();
    let val = Solution::max_ascending_sum(vec![10, 20, 30, 40, 50]);
    let expected = 150;
    log_result!(val == expected, "t2", start, &expected, &val);
    assert_eq!(val, expected);
}

#[test]
fn t3() {
    let start = std::time::Instant::now();
    let val = Solution::max_ascending_sum(vec![12, 17, 15, 13, 10, 11, 12]);
    let expected = 33;
    log_result!(val == expected, "t3", start, &expected, &val);
    assert_eq!(val, expected);
}

#[test]
fn t4() {
    let start = std::time::Instant::now();
    let val = Solution::max_ascending_sum(vec![42]);
    let expected = 42;
    log_result!(val == expected, "t4", start, &expected, &val);
    assert_eq!(val, expected);
}

#[test]
fn t5() {
    let start = std::time::Instant::now();
    let val = Solution::max_ascending_sum(vec![5, 4, 3, 2, 1]);
    let expected = 5;
    log_result!(val == expected, "t5", start, &expected, &val);
    assert_eq!(val, expected);
}