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:递推公式 a[i]=2*(a[i-1]+a[i-2]*(i-1)) ?

Posted by TongFei at 2009-05-22 22:07:18 on Problem 3734
In Reply To:递推公式 a[i]=2*(a[i-1]+a[i-2]*(i-1)) ? Posted by:ririyeye at 2009-05-17 13:05:22
> 对否?

你的考虑可能是不对的。
你大概考虑是最后一块:
如果最后一块是
 blue  有a[i-1]
 yellow  有a[i-1]

 red  从前面i-1个任选一块作为同色,则剩下的为:a[i-2]
 green 同上

但是 如下情况:
 R R R R R R
本来只有一次,你计算恐怕要远远多于一次吧。

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