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:简单的DP O(N)

Posted by test_3932 at 2012-02-14 21:05:19 on Problem 3932
In Reply To:简单的DP O(N) Posted by:JiaJunpeng at 2012-02-14 20:51:47
> dp[i][j][k],i表示位置,j有4种状态:0.火柴没有动,1.拿走1根火柴,2.拿来1根火柴,3.拿走1根火柴并放在之前的位置上,k表示是否进位,剩下就是状态转移乱搞,有点麻烦,不知道2K+的代码是肿么写出来的。。。。。
ORZ,同一个代码C++交735MS,G++交3485MS,肿么差距这么大??!!

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