UVALive - 3983——Robotruck（优先队列+DP）

题目链接：https://vjudge.net/problem/UVALive-3983

dp【i】表示从原点出发，将前i个立即清理完毕并放进垃圾桶的最小距离

#include<string.h>
#include<stdio.h>
#include<algorithm>
using namespace std;
const int M=100010;
int n,m;
int weight[M],origin[M],dis[M],q[M],dp[M],x[M],y[M];
int sum(int i)
{
    return dp[i]-dis[i+1]+origin[i+1];
}
int main()
{
    int t,w;
    scanf("%d",&t);
    while(t--)
    {
        scanf("%d%d\n",&m,&n);
        for(int i=1;i<=n;i++)
        {
            scanf("%d%d%d",&x[i],&y[i],&w);
            weight[i]=weight[i-1]+w;
            origin[i]=abs(x[i])+abs(y[i]);
            dis[i]=dis[i-1]+abs(x[i]-x[i-1])+abs(y[i]-y[i-1]);
        }
        int l=1,r=1;
        for(int i=1;i<=n;i++)
        {
            while(l<=r&&weight[i]-weight[q[l]]>m) ++l;
            dp[i]=sum(q[l])+dis[i]+origin[i];
            printf("%d\n",q[l]);
            while(l<=r&&sum(i)<=sum(q[r])) --r;
            q[++r]=i;
        }
        printf("%d\n%s",dp[n],t>0?"\n":"");
    }
}

白书73页