How to solve minimum sum parition probelem?

#1

cannot write correct code for minimum sum partition problem is it have the same concept as mixtures from spoj and matrix chain multiplication

#2

hello @rohitkandpal683
if this is the problem that u are talking about

image
image740×56 7.71 KB

then this has different approach , like any othersubset problem we use inclusion exclusion trick to generate all valid susbets and return minimum difference .
use dp/memoistaion to avoid recomputation of repeating states.

minimum sum partition

#3

thanks for help i understand this approach these type of question come under knapsack type .but still i have some confusions where do i use matrix chain and mixture problem concept of partitioning if possible please give link to that type of problem also so i can practice them as well

#4

well when to use what can only be cleared by solving so many problems.
right now i dont have any problemset which can be solved using matrix chain.

but u can follow this contest to cover all types of dp problems -> https://hack.codingblocks.com/app/contests/1043

also refer atcoder dp educational contest (contains 26 standard dp problems) it also contain some problems that can be solved using matrix chain,