zoj 3469 Food Delivery 区间dp + 提前计算费用

Time Limit: 2 Seconds      Memory Limit: 65536 KB

When we are focusing on solving problems, we usually prefer to stay in front of computers rather than go out for lunch. At this time, we may call for food delivery.

Suppose there are N people living in a straight street that is just lies on an X-coordinate axis. The i^th person‘s coordinate is X_i meters. And in the street there is a take-out restaurant which has coordinates X meters. One day at lunchtime, each person takes an order from the restaurant at the same time. As a worker in the restaurant, you need to start from the restaurant, send food to the N people, and then come back to the restaurant. Your speed is V^-1 meters per minute.

You know that the N people have different personal characters; therefore they have different feeling on the time their food arrives. Their feelings are measured byDispleasure Index. At the beginning, the Displeasure Index for each person is 0. When waiting for the food, the i^th person will gain B_i Displeasure Index per minute.

If one‘s Displeasure Index goes too high, he will not buy your food any more. So you need to keep the sum of all people‘s Displeasure Index as low as possible in order to maximize your income. Your task is to find the minimal sum of Displeasure Index.

Input

The input contains multiple test cases, separated with a blank line. Each case is started with three integers N ( 1 <= N <= 1000 ), V ( V > 0), X ( X >= 0 ), then N lines followed. Each line contains two integers X_i ( X_i >= 0 ), B_i ( B_i >= 0), which are described above.

You can safely assume that all numbers in the input and output will be less than 2³¹ - 1.

Please process to the end-of-file.

Output

For each test case please output a single number, which is the minimal sum of Displeasure Index. One test case per line.

Sample Input

5 1 0
1 1
2 2
3 3
4 4
5 5

Sample Output

55

#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
#define X first
#define Y second
using namespace std;

const int N = 1005;
const int INF = 0x3f3f3f3f;
typedef pair<int, int> pii;

pii p[N];
int sum[N];

int dp[N][N][2];
int n, v, x;

int get(int i, int j, int f)
{
    if(i == j) return dp[i][j][f];
    int& res = dp[i][j][f];
    if(res != -1) return res;
    res = INF;
    if(!f) {
        int add = sum[n] - (sum[j] - sum[i]);
        res = min(res, get(i + 1, j, 0) + (p[i + 1].X - p[i].X) * add);
        res = min(res, get(i + 1, j, 1) + (p[j].X - p[i].X) * add);
    }
    else {
        int add = sum[n] - (sum[j - 1] - sum[i - 1]);
        res = min(res, get(i, j - 1, 1) + (p[j].X - p[j - 1].X) * add);
        res = min(res, get(i, j - 1, 0) + (p[j].X - p[i].X) * add);
    }
    return res;
}

int main()
{
    while(~scanf("%d%d%d", &n, &v, &x))
    {
        for(int i = 1; i <= n; ++i)  scanf("%d%d", &p[i].X, &p[i].Y);
        p[++n].X = x;
        p[n].Y = 0;
        sort(p + 1, p + n + 1);
        sum[0] = 0;
        for(int i = 1; i <= n; ++i) sum[i] = sum[i - 1] + p[i].Y;

        int xpos;
        memset(dp, -1, sizeof dp);
        for(int i = 1; i <= n; ++i) if(p[i].X == x) { xpos = i; break; }
        for(int i = 1; i <= n; ++i) dp[i][i][0] = dp[i][i][1] = INF;
        dp[xpos][xpos][0] = dp[xpos][xpos][1] = 0;

        printf("%d\n", v * min(get(1, n, 0), get(1, n, 1)));
    }
    return 0;
}