天天看点
返回

Google Code jam Qualification Round 2015 --- Problem A. Standing OvationProblem A. Standing Ovation  Problem's Link:   https://code.google.com/codejam/contest/6224486/dashboard#s=p0

Mean: 

题目说的是有许多观众，每个观众有一定的羞涩值，只有现场站起来鼓掌的人数达到该值才会站起来鼓掌，问最少添加多少羞涩值任意的人，才能使所有人都站起来鼓掌。

analyse:

贪心模拟一下，从前往后扫一遍就行。

Time complexity: O(n)

Source code: 

Google Code jam Qualification Round 2015 --- Problem A. Standing OvationProblem A. Standing Ovation  Problem's Link:   https://code.google.com/codejam/contest/6224486/dashboard#s=p0
Google Code jam Qualification Round 2015 --- Problem A. Standing OvationProblem A. Standing Ovation  Problem's Link:   https://code.google.com/codejam/contest/6224486/dashboard#s=p0

View Code

standby file修改表空间 RDS MySQL引擎表索引 RDS MySQL引擎表索引无效 语音speech owa rds htap table索引批量
上一篇: 扩展KMP --- HDU 3613 Best Reward Best Reward Problem's Link:   http://acm.hdu.edu.cn/showproblem.php?pid=3613
下一篇: 怎么往JFrame中添加图片

继续阅读