农夫约翰发现奶牛在花园吃花，他需要按顺序将奶牛运回，每头奶牛破坏花朵的速度不同且运输需时间。问题求解最小化的花朵损失。输入输出描述及样例给出，提示和错误分析包含贪心算法的实现细节。
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 cows were in his garden eating his beautiful flowers. Wanting to minimize the subsequent damage, FJ decided to take immediate action and transport the cows back to their barn. Each cow i is at a location that is Ti minutes (1 <= Ti <= 2,000,000) away from the 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 the barn. Moving cow i to the barn requires 2*Ti minutes (Ti to get there and Ti to return). 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.
最低0.47元/天 解锁文章
46
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
