Concepts2
⚙️AlgorithmAdvanced
Subset Sum Convolution
Subset Sum Convolution (often called Subset Convolution) computes C[S] by summing A[T]×B[U] over all disjoint pairs T and U whose union is S.
#subset convolution#subset sum convolution#sos dp+11
⚙️AlgorithmAdvanced
Divide and Conquer DP Optimization
Divide and Conquer DP optimization speeds up DP transitions of the form dp[i][j] = min over k of dp[i-1][k] + C(k, j) when the optimal k is monotone in j.
#divide and conquer dp#monge array#quadrangle inequality+10