问Maximum_Subarray_Problem的变异

EN

global_max = -infinity
prefixSum[0] = 0
q = new MinQueue()
for i := 1 to n:
    prefixSum[i] = prefixSum[i - 1] + a[i]
    if i > 1
        q.enqueue(prefixSum[i - 1])
    if i - K - 1 >= 1
        q.dequeue()
    global_max = max(global_max, prefixSum[i] - q.min())

public void maxSubSet (int[] array, int k)
 {
    int startIndex = -1;
    int max = 0;

    for(int i =0; i<k; i++){  //Assuming k<array.length
        max += array[i];
        startIndex = 0;  
    }

    for(int i=k; i<array.length; i++){
        int sum = array[i] - array[i-k]; 
        if (sum > max){
            max = sum; 
            startIndex = i; 
        }
    }

    System.out.println("Max Sum:" + max);
    for(int i = startIndex; i<startIndex+k; i++)
        System.out.println(i+":"+array[i]);
}