Welcome to OStack Knowledge Sharing Community for programmer and developer-Open, Learning and Share
Welcome To Ask or Share your Answers For Others

Categories

0 votes
1.2k views
in Technique[技术] by (71.8m points)

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

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

与恶龙缠斗过久,自身亦成为恶龙;凝视深渊过久,深渊将回以凝视…
Welcome To Ask or Share your Answers For Others

1 Answer

0 votes
by (71.8m points)
Waitting for answers

与恶龙缠斗过久,自身亦成为恶龙;凝视深渊过久,深渊将回以凝视…
Welcome to OStack Knowledge Sharing Community for programmer and developer-Open, Learning and Share
Click Here to Ask a Question

...