HDU 3415 Max Sum of Max-K-sub-sequence 单调队列

题目连接:http://acm.hdu.edu.cn/showproblem.php?pid=3415
题意：求序列中长度不大于k的连续子序列的最大和使多少
我们可以用ANS[i] 表示 以第i个数为右边界的一个K区间的最大和的值
那么有方程
显然这里可以用一个长度为k的单调递增队列来维护最小值

代码：

#include <bits/stdc++.h>
#define sf scanf
#define pf printf

using namespace std;
const int maxn = 1000000 + 5,INF = 2e9;
int pre_sum[maxn * 2],A[maxn];
int minQueue[maxn * 2],front,tail;
int main(){
    pre_sum[0] = 0;
    int T;sf("%d",&T);
    while(T--){
        int n,k;sf("%d %d",&n,&k);
        front = tail = 0;
        for(int i = 1;i <= n;++i){
            sf("%d",&A[i]);
            pre_sum[i] = pre_sum[i - 1] + A[i];
        }
        for(int i = n + 1;i <= n * 2;++i){
            pre_sum[i] = pre_sum[i - 1] + A[i - n];
        }
        int ansSum = A[1],ansStart = 1,ansEnd = 1,ansLen = 1;
        for(int i = 0;i <= n + k;i++){
            while(front != tail && minQueue[front] < i - k) front++;
            int tmp = (front != tail) ? pre_sum[i] - pre_sum[minQueue[front]] : A[i];
            if(i != 0){
                int l = minQueue[front] + 1,r = i,len = r - l + 1;
                if(r > n) r -= n;
                if(l > n) l -= n;
                if(tmp > ansSum){
                    ansSum = tmp,ansStart = l,ansEnd = r,ansLen = len;
                }
                else if(tmp == ansSum){
                    if(l < ansStart){
                        ansSum = tmp,ansStart = l,ansEnd = r,ansLen = len;
                    }
                    else if(l == ansStart && len < ansLen){
                        ansSum = tmp,ansStart = l,ansEnd = r,ansLen = len;
                    }
                }
            }
            while(front != tail && pre_sum[minQueue[tail - 1]] >= pre_sum[i]) tail--;
            minQueue[tail++] = i;
        }

        pf("%d %d %d\n",ansSum,ansStart,ansEnd);
    }
}