Detail of message

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

这题题目有问题吧?

Posted by tdzl2003 at 2006-07-28 09:12:00 on Problem 2537

设1-k就AC,0-k连sample都过不去.

Followed by:

那很明显是你的问题而不是题的问题吧.... (27) wywcgs 2006-07-28 09:34:04
- 同问...为什么?楼上 (0) Speakless 2006-07-28 10:01:43
  - DP方法应该是DP[I][J]表示长度为I的串加入第J个字符成为TIGHT WORD的概率,那么DP[I][J]=(DP[I-1][J-1]+DP[I-1][J]+DP[I-1][J+1])/n (51) Speakless 2006-07-28 10:08:59

Post your reply here:

Home Page Go Back To top

All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator