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

Re:最长不下降……

Posted by fanci at 2012-06-21 15:51:48 on Problem 3670
In Reply To:Re:最长不下降…… Posted by:yuech at 2009-09-10 13:32:26
> 按照最长不下降子序列做的。。莫名奇妙的AC。。。但是不知道原理。。。哪位大牛给说一下。。
给定一个最优解。首先易知FJ没有翻牌的奶牛肯定构成一个单调序列。然后这个序列必定是最长单调序列,否则如果有一个更长的单调序列的话,FJ可以翻更少的牌,从而与假设矛盾。

Followed by:

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