UVA 1169 Robotruck(dp+单调队列滑动窗口)

定义dp[i]为把前i个垃圾倒到垃圾桶所走的距离，那么dp[i]=min(dp[j]+dist2[j+1]+dist[j+1][i]+dist2[i])，dist2[i]为从起点到i的曼哈顿距离，dist[j+1][i]为从j+1到i的捡垃圾的距离，现在设total_dist[i]为从起点到i的捡垃圾总距离，那么dist[j+1][i]=total_dist[i]-total_dist[j+1]，所以状态就变成了dp[i]=min(dp[j]+dist2[j+1]total_dist[j+1])+total_dist[i]+dist2[i]，并且用一个滑动窗口来取j，滑动窗口用单调队列维护，队头的元素一定是最优的j，每次添加元素时，如果队尾元素的func(i)很大的话，那么直接扔掉，因为取一定是取func小的，所以单调队列保证每次队头元素因为滑动窗口维护更新时丢弃时，接下来的元素还能保持最优。

#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
const int maxn=100000+10;
int x[maxn],y[maxn];
int total_dist[maxn],total_w[maxn],dist2[maxn];
int q[maxn],dp[maxn];
int abs(int x) {return x>0?x:-x;}
int func(int i) {return dp[i]+dist2[i+1]-total_dist[i+1];}
int main()
{
    int t;
    scanf("%d",&t);
    while(t--)
    {
        int c,n,w;
        scanf("%d%d",&c,&n);
        total_dist[0]=total_w[0]=x[0]=y[0]=0;
        for(int i=1;i<=n;i++)
        {
            scanf("%d%d%d",&x[i],&y[i],&w);
            dist2[i]=x[i]+y[i];
            total_dist[i]=total_dist[i-1]+abs(x[i]-x[i-1])+abs(y[i]-y[i-1]);
            total_w[i]=total_w[i-1]+w;
        }
        int front=1,rear=1;
        for(int i=1;i<=n;i++)
        {
            while(front<=rear&&total_w[i]-total_w[q[front]]>c) front++;
            dp[i]=func(q[front])+total_dist[i]+dist2[i];
            while(front<=rear&&func(i)<=func(q[rear])) rear--;
            q[++rear]=i;
        }
        printf("%d\n",dp[n]);
        if(t) printf("\n");
    }
    return 0;
}