## CSP 2021-09-2 non zero segment division problem solution

Title Link
The original question is linked in Non zero segment division , I won't post the title. Given an array, you can divide the array into as many continuous non-zero segments as possible by changing the number below the threshold into 0.
Topic analysis
A very direct idea is: there are m different non-zero values in the array with l ...

Posted by **AaZmaN** on *Fri, 01 Oct 2021 17:05:23 -0700*

## CSP-J2020 semi-finals solution

CSP-J rematch tutorial: , don't miss the semi-finals.
T1: excellent power
Title Description
Generally speaking, a positive integer can be divided into the sum of several positive integers. For example, 1 = 1, 10 = 1 + 2 + 3 + 4, etc. For a specific split of positive integer n, we call it "excellent" if and only if under this split ...

Posted by **archangel_617b** on *Wed, 22 Sep 2021 05:34:10 -0700*