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

f[i][j] = f[i][j - 1] + f[i - j][j] ;

Posted by 117474335 at 2010-10-15 13:57:11 on Problem 3181
解释:
f[i][j] 表示 数i 用 1 到 j 拼 , 共有多少种情况;
可分为两种情况:
1、最大数小于j, 则为用1到就j - 1拼i;
2、最大数等于j, 则为用1到j拼 减去一个 最大数j的 i - j ;
简单递推即可 ;

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