 |
| ||||
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 | |||||||||
Re:求助poj1991的Dp方程In Reply To:求助poj1991的Dp方程 Posted by:tsc13579 at 2008-06-06 15:44:37 先按照Pi排序。F[i][j][0..1]表示第i个教室与第j个教室之间的作业还没收过，0表示在教室i，1表示在教室j的最小时间。 Followed by:
Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator
