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

这题用short开二维数组也要40000K多，用滚动数组就256K的确是很好的东东~

Posted by SWUST_smiles at 2010-08-15 19:49:07 on Problem 1159 
i
f(str1[i]==str2[j]) Max[i%2][j]=Max[(i-1)%2][(j-1)]+1;
else if(Max[(i-1)%2][j]>Max[i%2][(j-1)]) Max[i%2][j]=Max[(i-1)%2][j];
else Max[i%2][j]=Max[i%2][(j-1)];
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