zoj 3469 区间dp
来源:互联网 发布:stc90c516rd数据手册 编辑:程序博客网 时间:2024/05/17 02:03
http://acm.zju.edu.cn/onlinejudge/showProblem.do?problemCode=3469
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
出处:http://blog.csdn.net/woshi250hua/article/details/7768744
</pre><pre name="code" class="cpp">#include <stdio.h>#include <iostream>#include <string.h>#include <algorithm>using namespace std;const int INF=9999999999;struct note{ int x,v;};note a[1005];int sum[1005],dp[1005][1005][2];int n,x,v,res;int cmp(note a,note b){ return a.x<b.x;}int get(int l,int r){ if(l>r) return 0; return sum[r]-sum[l-1];}int DP(){ for(int i=1;i<=n;i++) { if(a[i].x==x) { res=i; break; } } for(int i=1;i<=n;i++) for(int j=1;j<=n;j++) dp[i][j][1]=dp[i][j][0]=INF; dp[res][res][0]=0; dp[res][res][1]=0; for(int i=res;i>=1;i--) for(int j=res;j<=n;j++) { if(i==j) continue; int delay=get(1,i-1)+get(j+1,n); dp[i][j][0]=min(dp[i][j][0],dp[i+1][j][1]+(delay+a[i].v)*(a[j].x-a[i].x)); dp[i][j][0]=min(dp[i][j][0],dp[i+1][j][0]+(delay+a[i].v)*(a[i+1].x-a[i].x)); dp[i][j][1]=min(dp[i][j][1],dp[i][j-1][0]+(delay+a[j].v)*(a[j].x-a[i].x)); dp[i][j][1]=min(dp[i][j][1],dp[i][j-1][1]+(delay+a[j].v)*(a[j].x-a[j-1].x)); //printf("(%d,%d)\n",dp[i][j][0],dp[i][j][1]); } //printf("(%d,...%d)\n",dp[1][n][0],dp[1][n][1]); return min(dp[1][n][1],dp[1][n][0]);}int main(){ while(~scanf("%d%d%d",&n,&v,&x)) { for(int i=1;i<=n;i++) scanf("%d%d",&a[i].x,&a[i].v); a[++n].x=x,a[n].v=0; memset(sum,0,sizeof(sum)); sort(a+1,a+1+n,cmp); for(int i=1;i<=n;i++) { sum[i]=sum[i-1]+a[i].v; } int ans=DP(); //printf("[%d]\n",v); printf("%d\n",ans*v); } return 0;}
- ZOJ 3469 区间dp
- zoj 3469 区间dp
- ZOJ 3469(区间DP)
- ZOJ 3469 区间DP
- ZOJ Problem Set - 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)
- 学习安卓第一课
- 一个红黑树的优化实验
- Spring jar包详解
- 关于JVM的几个参数,以供自己参考便利
- C++控制台实现俄罗斯方块
- zoj 3469 区间dp
- 基于 Paraview 扩展与实现——(5)
- 第5周作业-字体设置
- RelativeLayout中使用include标签对齐不起作用解决方法
- 详解rsync算法--如何减少同步文件时的网络传输量
- 100内素数的求法比较
- 流水线概述
- 深入浅出说编译原理
- 裴波那契整除(摘自数论及应用)