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 |
f[i][j] = f[i][j - 1] + f[i - j][j] ;解释: 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: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator