天天看點
傳回

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中添加圖檔

繼續閱讀