 |
| ||||
Home Page
F.A.Qs
Statistical Charts
Past Contests
Scheduled Contests
Award Contest
| ||||||||||
| 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 | |||||||||
弱弱的用背包搞定，但是复杂度未知，险过。还是得用数学分析啊。当前和为sum的时候sum-2*t=n 枚举一个i把所有小于等于i的所有组合用背包列举出来。 然后看看dp[t]是不是可以组成。 我的容量开到了1百万。 Followed by: Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator
