I am in my early stages of learning dp
Just wanted to know is it always possible to convert a dp solution into a recursive one
If so can anyone write the recursive code for this dp solution
Spoiler
The question is similar to this, the only difference is that we have to find the minimum elements to remove from the sequence b so that it can be sent over the network
Auto comment: topic has been updated by ayush118 (previous revision, new revision, compare).
Here's your recursive solution