Online Judge | Problem Set | Authors | Online Contests | User | ||||||
---|---|---|---|---|---|---|---|---|---|---|
Web Board Home Page F.A.Qs Statistical Charts | Current Contest Past Contests Scheduled Contests Award Contest |
其实只要确定每个时间点出售的蛋糕的最小代价即可。用单调队列优化。o(m)In Reply To:Time Limit Exceeded 5555 Posted by:newbgirl at 2012-07-08 18:06:54 > 总是Time Limit Exceeded呢,难道有什么取巧的算法么,还是我哪个地方题意理解有问题 Followed by: Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator