poj 3709 K-Anonymous Sequence(DP-单调性优化-斜率优化)

#include <iostream>
#include <cstdio>
using namespace std;

#define ll long long int
const int maxn = 500010;
ll dp[maxn] , sum[maxn] , A[maxn];
int que[maxn] , head , tail;
int n , k;

void initial(){
    for(int i = 0; i < maxn; i++){
        dp[i] = 0;
        sum[i] = 0;
        A[i] = 0;
    }
    head = 0;
    tail = 0;
}

void readcase(){
    scanf("%d%d" , &n , &k);
    for(int i = 1; i <= n; i++){
        scanf("%lld", &A[i]);
        sum[i] = A[i]+sum[i-1];
    }
}

void computing(){
    if(n < 2*k){
        printf("%lld\n" , sum[n]-n*A[1]);
        return ;
    }
    que[tail] = k;
    for(int i = k; i < 2*k; i++){
        dp[i] = sum[i]-i*A[1];
    }
    for(int i = 2*k; i <= n; i++){
        while(head < tail){
            int j = que[head%maxn] , m = que[(head+1)%maxn];
            if(i*(A[m+1]-A[j+1]) >= dp[m]-dp[j]+m*A[m+1]-j*A[j+1]+sum[j]-sum[m]) head++;
            else break;
        }
        dp[i] = dp[que[head%maxn]]+sum[i]-sum[que[head%maxn]]-(i-que[head%maxn])*A[que[head%maxn]+1];
        int tem = i-k+1;
        while(head < tail){
            int j = que[(tail-1)%maxn] , m = que[tail%maxn];
            if((dp[m]-dp[j]+m*A[m+1]-j*A[j+1]+sum[j]-sum[m])*(A[tem+1]-A[m+1]) >= (dp[tem]-dp[m]+tem*A[tem+1]-m*A[m+1]+sum[m]-sum[tem])*(A[m+1]-A[j+1])) tail--;
            else break;
        }
        que[(++tail)%maxn] = tem;
    }
    printf("%lld\n" , dp[n]);
}

int main(){
    int T;
    scanf("%d" , &T);
    while(T--){
        initial();
        readcase();
        computing();
    }
    return 0;
}