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[