Online JudgeProblem SetAuthorsOnline ContestsUser
Web Board
Home Page
F.A.Qs
Statistical Charts
Problems
Submit Problem
Online Status
Prob.ID:
Register
Update your info
Authors ranklist
Current Contest
Past Contests
Scheduled Contests
Award Contest
User ID:
Password:
  Register

其实只要确定每个时间点出售的蛋糕的最小代价即可。用单调队列优化。o(m)

Posted by yygy at 2014-07-28 23:32:09 on Problem 4002
In Reply To:Time Limit Exceeded 5555 Posted by:newbgirl at 2012-07-08 18:06:54
> 总是Time Limit Exceeded呢,难道有什么取巧的算法么,还是我哪个地方题意理解有问题

Followed by:
  • AA (0) yygy 2014-07-30 21:42:13

Post your reply here:
User ID:
Password:
Title:

Content:

Home Page   Go Back  To top


All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator