This should be a very common introductory problem for dynamic programming. You can use Google to search for exactly the same model.
8 Likes
Yes, the merging problem is well known, except that the Codechef version was “circular” merging.
In fact, the “circular” merging version is also well known.
Yeah, It was a standard DP
Disappointed after seeing this.
1 Like
What happend? 
How the algorithm proceed can you explain it ?
In long challenges we expect new questions.
2 Likes
It was classical dynamic problem famously knows as Matrix Multiplication, wondering what’s the problem if it is, because every problem has some subset logic.
1 Like
Circular isn’t big deal just be greedy and permute it in such a way that largest element comes at end or in beginning and then it’s simply non-circular.
2 Likes
Indeed, I don’t think this problem should be there.
1 Like
Yes, so I think this one should be unrated.
You’re right. Thank you for your commit. It helped me a lot. 
Don’t say that I spent lot of time in this contest.
2 Likes
OK, I’m just kidding.
No man, I would be 4 star after this
It was just Matrix chain multiplication
In that case, you will certainly be able to get it in the future.