Food Delivery ZOJ - 3469 区间dp

https://cn.vjudge.net/problem/ZOJ-3469

题目大意： 有n个人在一条直线上分布第i个人在第xi个位置， 还有一个餐厅，这个餐厅要给这些人送饭，送饭的人的移动速度是1/V ，每等待一分钟，第i个人会+BI的烦恼，要使总烦恼最少。

因为要使i-j的人送到则最后送到的必然是i或者j，所以有dp[i][j][k] 表示i-j送到时候留着i或者留着j时的最优解，k=0表示在i,k=1表示在j

则有转移方程

    dp[i][j][0] min dp[i+1][j][0]+ (sheng + v[i])*(x[i+1]-x[i]);  //sheng是还没送过的点的烦恼值
    dp[i][j][0] min dp[i+1][j][1] + (sheng + v[i])*(x[j]-x[i]);
    dp[i][j][1] min dp[i][j-1][0]+  (sheng + v[j])*(x[j]-x[i]);
    dp[i][j][1] min dp[i][j-1][1] + (sheng + v[i])*(x[j]-x[j-1]);

#include<stdio.h>
#include<iostream>
#include<string.h>
#include<algorithm>
#include<map>
#include<set>
#include<vector>
#include<math.h>
#include<queue>
#define lowbit(x)  (x&(-x))
const double eps=1e-8;
const int inf=0x3f3f3f3f;
using namespace std;
const int maxn=1e3+7;
typedef long long ll;
#define ls rt<<1
#define rs rt<<1|1
#define m(i) (node[i].l+node[i].r)>>1

struct AA
{
    int x,v;

}p[maxn];
bool cmp(AA a,AA b)
{
    return a.x < b.x;
}

/*
    dp[i][j][0] min dp[i+1][j][0]+(sheng + v[i])*(x[i+1]-x[i]);
    dp[i][j][0] min dp[i+1][j][1] +(sheng + v[i])*(x[j]-x[i]);
    dp[i][j][1] min dp[i][j-1][0]+(sheng + v[j])*(x[j]-x[i]);
    dp[i][j][1] min dp[i][j-1][1] +(sheng + v[i])*(x[j]-x[j-1]);
*/

int s[maxn];

int sum(int l,int r)
{
    if(r < l) return 0;
    return s[r]-s[l-1];
}
int dp[maxn][maxn][3];

int main()
{
    int n,V,X;
    while(~scanf("%d%d%d",&n,&V,&X))
    {
        for(int i = 1;i <= n;i++)
            scanf("%d%d",&p[i].x,&p[i].v);
        p[n+1].x = X,p[n+1].v = V;
        sort(p+1,p+n+2,cmp);
        s[0] = 0;
        for(int i = 1; i<= 1+n;i++)
        {
            s[i] = s[i-1]+p[i].v;
        }
        int st = 0;
        for(int i = 1;i <= n+1;i++) if(p[i].x == X) st = i;
        for(int i = 0;i <= n+1;i++)
            for(int j = 0; j <= n+1;j++)
                dp[i][j][0] = dp[i][j][1] = inf;
        dp[st][st][1] = dp[st][st][1] = 0;
      //  printf("%d\n",st);
        for(int i = st;i >= 1;i--)
        {
            for(int j = st;j <= n+1;j++)
            {
                if(i == j) continue;
                int yu = sum(1,i-1) + sum(j+1,n+1);
                dp[i][j][0] = min(dp[i+1][j][0] + (yu + p[i].v)*(p[i+1].x-p[i].x),dp[i][j][0]);
                dp[i][j][0] = min(dp[i+1][j][1] + (yu + p[i].v)*(p[j].x-p[i].x),dp[i][j][0]);
                dp[i][j][1] = min(dp[i][j-1][0] + (yu + p[j].v)*(p[j].x-p[i].x),dp[i][j][1]);
                dp[i][j][1] = min(dp[i][j-1][1] + (yu + p[j].v)*(p[j].x-p[j-1].x),dp[i][j][1]);
             //   printf("dp[%d][%d][%d] = %d\n",i,j,0,dp[i][j][0]);
             //   printf("dp[%d][%d][%d] = %d\n",i,j,1,dp[i][j][1]);
            }
        }
        printf("%d\n",min(dp[1][n+1][0],dp[1][n+1][1])*V);
    }
	return 0;
}