Hello guys, I'm having trouble with a problem.
Given an array A and a number k, find the k-th largest continuous subsequence! I can only think of a brute-force solution using prefix sum, which run in
O(n ^ 2). In this problem n could be as large as
1e5. Can anyone give me a hint?
Thanks in advance!