dynamic programming - the number of the way to split the array into some segments which none of the segments have sum equal to s

Question

the number of the way to split the array into some segments(contiguous part of the array) such none of segments sum be equal to s?

there is o(n^2) solution

dp[i]=the problems solution using first i elements of array

dp[i]=dp[0]+...dp[i-1]

solve this with best time complexity

question from:https://stackoverflow.com/questions/65601375/the-number-of-the-way-to-split-the-array-into-some-segments-which-none-of-the-se

Answer 1

Waitting for answers