← All problemsSign in

Maximum Average Subarrays

CSESAdditional Problems IOpen on judge ↗

You are given an array of n integers. For each i = 1, 2,\dots, n, your task is to find the subarray ending at index i with the largest average. If there are multiple subarrays with the largest average, you should find the longest one. Input The first line has an integer n: the size of the array. The next line has n integers x_1, x_2,\dots, x_n: the contents of the array. Output Print n intege

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

Sign in to chat with the tutor and save your progress.

Sign in to start