Minimum Maximum Confusion

CodeChefOpen on judge ↗

Problem description. You are given two sequences of N elements P and Q. You have to partition them where the cost of making a partition from index L to R is cost = min(P[L...N])*max(Q[1...R]). Find the minimum and the maximum cost of partitioning the two sequences into exactly K partitions. Remember, the partitions of the two sequences must be the same, you cannot make different partitions for P

HINT LADDERno hints yet

L1 Observation

L2 Technique

L3 Approach

L4 Pseudo-code

🔒

L5 Full solution

L5 unlocks only if you insist twice

solution.cppC++17

CodeSearch Tutor

Hints, not spoilers — it won’t hand over the full solution unless you insist.

voice by Sarvam AI