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

这题好弱啊

Posted by JiangLY at 2005-04-10 15:01:00 on Problem 1609 
将它转化为MAX_X*MAX_Y的方格矩阵，x[i,j]表示有多少个l=i,m=j的板。
则答案就是从(1,1)只可向下和向右地走到(MAX_X,MAX_Y)所取得的最大值。
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