HDU3420 Bus Fair
来源:互联网 发布:网络攻击日语 编辑:程序博客网 时间:2024/06/05 07:48
Bus Fair
Time Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64uDescription
You are now in Foolish Land. Once moving in Foolish Land you found that there is a strange Bus fair system. The fair of moving one kilometer by bus in that country is one coin. If you want to go to X km and your friend wants to go to Y km then you can buy a ticket of X+Y coins (you are also allowed to buy two or more tickets for you two).
Now as a programmer, you want to show your creativity in buying tickets! Suppose, your friend wants to go 1 km and you want to go 2 km. Then it’s enough for you to buy a 2coin ticket! Because both of you are valid passengers before crossing the first km. and when your bus cross the first km your friend gets down from the bus. So you have the ticket of 2km! And you can safely reach to your destination, 2km using that ticket.
Now, you have a large group of friends and they want to reach to different distance. You think that you are smart enough that you can buy tickets that should manage all to reach their destination spending the minimum amount of coins. Then tell us how much we should at least pay to reach our destination.
Now as a programmer, you want to show your creativity in buying tickets! Suppose, your friend wants to go 1 km and you want to go 2 km. Then it’s enough for you to buy a 2coin ticket! Because both of you are valid passengers before crossing the first km. and when your bus cross the first km your friend gets down from the bus. So you have the ticket of 2km! And you can safely reach to your destination, 2km using that ticket.
Now, you have a large group of friends and they want to reach to different distance. You think that you are smart enough that you can buy tickets that should manage all to reach their destination spending the minimum amount of coins. Then tell us how much we should at least pay to reach our destination.
Input
There are multiple test cases. Each case start with a integer n, the total number of people in that group. 0<=n<=1000. Then comes n integers, each of them stands for a distance one of the men of the group wants to go to. You can assume that the distance a man wants to go is always less than 10000.
Output
Your program should print a single integer for a single case, the minimum amount of coins the group should spend to reach to the destination of all the members of that group.
Sample Input
212223
Sample Output
24
题意
n 个人一起坐车,下了车的人可以把票给其他的人,只要满足当前的票数够所有人到下一站,就不用买票,否则就需要补足不够的票。问最少满足所有人都到达目的地的票数是多少。
分析
判断 n 人到达当前站的 cost 是否够 n-1 个人到达下一站,不够则更新 cost 为 n-1 人到达下一站的总花费,否则继续判断 cost 是否能让 n-2 个人再次到站,直到判断到所有人都到站为止。状态转移方程为 cost = (n-i) * a[i]。
AC代码如下
#include <cstdio>#include <algorithm>#define maxn 1000+5using namespace std;int a[maxn];int main(){ int n; while(~scanf("%d",&n)) { for(int i = 0 ; i < n; i++) scanf("%d",&a[i]); sort(a,a+n); int cost = 0; for(int i = 0 ; i < n; i++) if(cost < (n-i) * a[i]) cost = (n-i) * a[i]; printf("%d\n",cost); } return 0;}
0 0
- HDU3420 Bus Fair
- hdu 3420 Bus Fair
- hdu 3420 Bus Fair
- hdoj 3420 bus Fair
- HDUOj BUS Fair 题目3420
- HDOJ 3420 Bus Fair(动规)
- HDU 3420 Bus Fair(贪心)
- HDU:3420 Bus Fair, 3090 Go Home+uva:11729 Commando War(简单贪心)
- Codeforces Round #436 (Div. 2) A.Fair Game B.Polycarp and Letters C. Bus D.Make a Permutation!
- bus
- BUS
- bus
- scarborough fair
- scarborough fair
- Career Fair
- Fair Scheduler
- Fair Division
- Fair Division
- Android开发四大组件---Service详解
- 强连通分量分解 Kosaraju算法 (poj 2186 Popular Cows)
- Unity3D 与Android 相互传递消息
- [Eclispe] NDK内建include路径修改
- 子界类型、集合类型、记录类型、文件类型
- HDU3420 Bus Fair
- ACM我来了
- [C++设计模式] command 命令模式
- exports VS module.exports
- zTree -- jQuery 树插件 使用小结
- UVa 1339 古老的密码
- 有关安卓的设计(持续更新)
- 猫东formValidator对SELECT(单选)控件处理的bug
- pytho获取磁盘剩余空间