Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: The maximum subarray problem is to find the contiguous array elements having the largest possible sum.  extend this problem to find K maximum subarrays. For general K maximum subarrays where overlapping is allod, Bengtsson and Chen presented $$O\left(\mathit{min}\right\{K+n{\hbox{ log }}^{2}n,n\sqrt{K}\left\}\right)$$ time algorithm for one-dimensional case, which finds unsorted subarrays. Our algorithm finds K maximum subarrays in sorted order with improved complexity of O ((n + K) log K). For the two-dimensional case,  introduce two techniques that establish O(n3) and subcubic time.
['Sung Eun Bae', 'Tadao Takaoka']
I am writing a research paper on a idea Improved Algorithms for the K-Maximum Subarray Problem
[{"from": "human", "value": "I am writing a research paper on a idea Improved Algorithms for the K-Maximum Subarray Problem"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: The maximum subarray problem is to find the contiguous array elements having the largest possible sum.  extend this problem to find K maximum subarrays. For general K maximum subarrays where overlapping is allod, Bengtsson and Chen presented $$O\\left(\\mathit{min}\\right\\{K+n{\\hbox{ log }}^{2}n,n\\sqrt{K}\\left\\}\\right)$$ time algorithm for one-dimensional case, which finds unsorted subarrays. Our algorithm finds K maximum subarrays in sorted order with improved complexity of O ((n + K)\u2009log\u2009K). For the two-dimensional case,  introduce two techniques that establish O(n3) and subcubic time."}]