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

Given a circle sequence A[1],A[2],A[3]......A[n]. Circle sequence means the left neighbour of A[1] is A[n] , and the right neighbour of A[n] is A[1]. 
Now your job is to calculate the max sum of a Max-K-sub-sequence. Max-K-sub-sequence means a continuous non-empty sub-sequence which length not exceed K.

 

Input

The first line of the input contains an integer T(1<=T<=100) which means the number of test cases. 
Then T lines follow, each line starts with two integers N , K(1<=N<=100000 , 1<=K<=N), then N integers followed(all the integers are between -1000 and 1000).

 

Output

For each test case, you should output a line contains three integers, the Max Sum in the sequence, the start position of the sub-sequence, the end position of the sub-sequence. If there are more than one result, output the minimum start position, if still more than one , output the minimum length of them.

简单来说 题意就是给一个环，问在这个环上选一个长度小于等于k的子串的最大值。

从数据范围上看，dp肯定是会超时。所以决定使用单调队列。

又因为是一个环，那么可以在这条链后面补充进去一条相同的链，从而达到和环相同的效果（只补k个即可，可以证明）

#include <cstdio>
#include <queue>
#include <algorithm>
#include <cstring>
using namespace std;

int a[111111];
int sum[211111];
const int INF = 0x3fffffff;

int main()
{
    int t,n,m,i,j,k,head,end;
    scanf("%d",&t);
    while(t--)
    {
        scanf("%d%d",&n,&k);
        j = n;
        sum[0] = 0;
        for(i = 1; i<=n; i++)
        {
            scanf("%d",&a[i]);
            sum[i] = sum[i-1]+a[i];
        }
        int ans = -INF;
        for(i = n+1; i<n+k;i++)
            sum[i] = sum[i-1]+a[i-n];
        n = n+k-1;
        deque<int> q;
        q.clear();
        for(i = 1; i<=n; i++)
        {
            while(!q.empty() && sum[i-1]<sum[q.back()]) //维持队列的单调性
                q.pop_back();
            while(!q.empty() && q.front()<i-k) //保证队列中的元素不过期
                q.pop_front();
            q.push_back(i-1);//存索引方便查找是否过期
            if(sum[i]-sum[q.front()]>ans)
            {
                ans = sum[i]-sum[q.front()];
                head = q.front()+1;
                end = i;
            }
        }
        if(end>j)
        end%=j;
        printf("%d %d %d\n",ans,head,end);
    }

    return 0;
}