find the subsequence with the biggest average

Revision en1, by Gi4Th4ng_Di77_NLUN, 2024-08-14 19:01:47

Hi guys, Im having a promblem about the number, but I haven't solved. PLS Help me. The problem is: Given an array a (length 2e5) of positive integer numbers. Chose a subsequence from L to R (1 < L <= R < n) Delete all the number from Al -> Ar. Find the max average of the left nums.

Sample INPUT 5 5 1 7 8 2 Sample OUTPUT 2.667

2 subtask: n <= 1e3 and n <= 1e5 I solve the first one, but not the latter.

Tags number, array, real number

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en4 English Gi4Th4ng_Di77_NLUN 2024-08-16 15:29:00 11 Tiny change: 'array a)\n5\n5 1 7 8 2\nSample O' -> 'array a)\n**5** \n``\n_5 1 7 8 2_\nSample O'
en3 English Gi4Th4ng_Di77_NLUN 2024-08-16 15:19:10 157
en2 English Gi4Th4ng_Di77_NLUN 2024-08-14 19:07:11 40
en1 English Gi4Th4ng_Di77_NLUN 2024-08-14 19:01:47 468 Initial revision (published)