Food Delivery - ZOJ 3469 dp
来源:互联网 发布:马曳 知乎 编辑:程序博客网 时间:2024/06/05 18:35
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 ith person's coordinate is Xi 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 by Displeasure Index. At the beginning, the Displeasure Index for each person is 0. When waiting for the food, the ith person will gain Bi 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 Xi ( Xi >= 0 ), Bi ( Bi >= 0), which are described above.
You can safely assume that all numbers in the input and output will be less than 231 - 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
题意:在一个一维的坐标轴上,一个人去送外卖,每个客户每等待一分钟就会增加相应的不满意度,求不满意度的最小值。
思路:按坐标排序后,dp[i][j][0|1]表示送完i-j的外卖,并且留在左|右端点后,所有顾客累计的不满意度的总和,然后向两边转移。
AC代码如下:
#include<cstdio>#include<cstring>#include<algorithm>using namespace std;struct node{ int x,cost;}box[1010];bool cmp(node a,node b){ return a.x<b.x;}int n,m,v,dp[1010][1010][2],sum[1010],INF=1e9;int find(int k){ int l=1,r=n,mi; while(l<r) { mi=(l+r)/2; if(box[mi].x<k) l=mi+1; else r=mi; } return l;}int main(){ int i,j,k,pos; while(~scanf("%d%d%d",&n,&v,&k)) { box[1].x=k;box[1].cost=0; n++; for(i=2;i<=n;i++) scanf("%d%d",&box[i].x,&box[i].cost); sort(box+1,box+1+n,cmp); for(i=1;i<=n;i++) sum[i]=sum[i-1]+box[i].cost; pos=find(k); for(i=1;i<=n;i++) for(j=1;j<=n;j++) dp[i][j][0]=dp[i][j][1]=INF; dp[pos][pos][0]=dp[pos][pos][1]=0; for(i=pos;i>=1;i--) for(j=pos;j<=n;j++) if(!(i==pos && j==pos)) { dp[i][j][0]=min(dp[i+1][j][0]+(sum[n]-sum[j]+sum[i])*(box[i+1].x-box[i].x), dp[i+1][j][1]+(sum[n]-sum[j]+sum[i])*(box[j].x-box[i].x)); dp[i][j][1]=min(dp[i][j-1][0]+(sum[n]-sum[j-1]+sum[i-1])*(box[j].x-box[i].x), dp[i][j-1][1]+(sum[n]-sum[j-1]+sum[i-1])*(box[j].x-box[j-1].x)); } printf("%d\n",min(dp[1][n][0],dp[1][n][1])*v); }}
- ZOJ 3469 Food Delivery(DP)
- Food Delivery - ZOJ 3469 dp
- Zoj 3469 Food Delivery (DP
- ZOJ 3469 Food Delivery DP
- ZOJ 3469 Food Delivery / 区间DP
- ZOJ 3469 Food Delivery (区间dp)
- zoj 3469 Food Delivery(区间dp)
- zoj 3469 Food Delivery(区间dp)
- ZOJ 3469 - Food Delivery(区间DP)
- ZOJ 3469 Food Delivery (区间DP)
- ZOJ 3469 Food Delivery -- 区间dp
- zoj 3469 Food Delivery (区间dp)
- ZOJ - 3469 Food Delivery(区间DP)
- ZOJ - 3469 Food Delivery(区间DP)
- ZOJ 3469 Food Delivery(区间DP)
- zoj 3469 Food Delivery 【区间dp】
- zoj 3469 Food Delivery (区间DP)
- ZOJ 3469 Food Delivery(区间DP)
- kernel 3.18 3.12无法安装parallels tool
- 第一个项目(Maven学习3)
- 8c 利用定时器实现时钟
- uva 10801(乘电梯dijkstra)
- codefroces 482C Game with Strings (概率dp神题)
- Food Delivery - ZOJ 3469 dp
- 栈和队列
- 机器学习中的数据清洗与特征处理综述
- 寒假水题集
- HTML网页中插入本地音乐
- iOS 折线图 ARLineChart-master
- 闻名不如见面——三层
- ubuntu的xorg的配置文件通过/var/log/Xorg.0.log查看位置
- 使用Event Bus模式解耦Android App组件间通信