Poj 3262 Protecting the flowers
来源:互联网 发布:php支付宝接口开发教程 编辑:程序博客网 时间:2024/05/20 15:58
Description
Farmer John went to cut some wood and left N (2 ≤ N ≤ 100,000) cows eating the grass, as usual. When he returned, he found to his horror that the cluster of cows was in his garden eating his beautiful flowers. Wanting to minimize the subsequent damage, FJ decided to take immediate action and transport each cow back to its own barn.
Each cow i is at a location that is Ti minutes (1 ≤ Ti ≤ 2,000,000) away from its own barn. Furthermore, while waiting for transport, she destroys Di (1 ≤ Di ≤ 100) flowers per minute. No matter how hard he tries, FJ can only transport one cow at a time back to her barn. Moving cow i to its barn requires 2 × Ti minutes (Ti to get there and Ti to return). FJ starts at the flower patch, transports the cow to its barn, and then walks back to the flowers, taking no extra time to get to the next cow that needs transport.
Write a program to determine the order in which FJ should pick up the cows so that the total number of flowers destroyed is minimized.
Input
Lines 2..N+1: Each line contains two space-separated integers, Ti and Di, that describe a single cow's characteristics
Output
Sample Input
63 12 52 33 24 11 6
Sample Output
86
Hint
点击打开链
设放在开头的为(d1,t1) 放在第二个的为(d2,t2)。
设当前剩余牛的d值和为ds。
那么有:
(ds-d1)*t1+(ds-d1-d2)*t2<(ds-d2)*t2+(ds-d2-d1)*t1
化简得:
t2/d2>t1/d1。
也就是说,当t[i]/d[i]>t[j]/t[j]时,j放在i前面更优。
所以我们可以按t[i]/d[i]排序,从小取到大就是最终序列了。
#include<stdio.h>#include<algorithm>using namespace std;struct node{ __int64 T; __int64 D;}Node[100010];__int64 sum[100010];bool cmp(struct node a,struct node b){ return (double)a.T/a.D < (double)b.T/b.D;}int main(){ int n; int i; __int64 mins; while(scanf("%d",&n)!=EOF){ mins = 0; for(i = 0;i<n;i++) { scanf("%I64d%I64d",&Node[i].T,&Node[i].D); Node[i].T*=2; } sort(Node,Node+n,cmp); sum[n-1] = Node[n-1].D; for(i = n-2;i>=0;i--) sum[i] = sum[i+1]+Node[i].D; for(i = 1;i<n;i++) mins += sum[i]*Node[i-1].T; printf("%I64d\n",mins); } return 0;}
- POJ 3262 Protecting the Flowers
- POJ 3262 Protecting the Flowers
- POJ-3262-Protecting the Flowers
- Poj 3262 Protecting the flowers
- POJ 3262 Protecting the Flowers
- POJ-3262-Protecting the Flowers
- POJ-3262-Protecting the Flowers
- poj-3262-Protecting the Flowers
- poj 3262 Protecting the Flowers
- poj 3262 Protecting the Flowers
- poj 3262 Protecting the Flowers
- poj 3262 Protecting the Flowers
- POJ 3262 Protecting the Flowers
- POJ 3262 - Protecting the Flowers
- POJ 3262 Protecting the Flowers
- POJ 3262 Protecting the Flowers
- poj 3262 Protecting the Flowers
- POJ 3262 Protecting the Flowers
- EGit
- (libgdx小结)切换游戏界面
- 基础总结篇之二:Activity的四种launchMode
- 2014年3月要看的书!
- inline内联函数
- Poj 3262 Protecting the flowers
- L2TP VPN 错误提示789解决
- the latest arrival date javascript
- 最少转弯问题
- js里面有中文乱码
- day43 Sping AOP @AspectJ
- 开心的金明
- 一个奇怪的问题,pw导出格式导致的DB2错误
- 数据库文件的组织