Ketekon and Chips

CodeChefOpen on judge ↗

###Problem Statement: There are $N$ chips packets numbered (1,2..N) containing $A[i]$ chips in it. Ketekon (King of Keteki Country), loves to eat a lot of chips,but the king can take only $k$ consecutive chips packets ,beacuse $K$eteki Country follows the $K$-Rule. Find the maximum number of chips which the king can have. ###Input: The first line of the input contains 2 space-separated integers $

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