摘要: Beans Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2637 Accepted Submission(s): 1302 Problem D 阅读全文
posted @ 2019-07-23 18:05 _Ackerman 阅读(563) 评论(0) 推荐(0) 编辑
摘要: 定义状态 F[i][j]表示以a串的前i个整数与b串的前j个整数且以b[j]为结尾构成的LCIS的长度。 状态转移方程: ①F[i][j] = F[i-1][j] (a[i] != b[j]) ②F[i][j] = max(F[i-1][k]+1) (1 <= k <= j-1 && b[j] > 阅读全文
posted @ 2019-07-23 17:05 _Ackerman 阅读(2409) 评论(0) 推荐(3) 编辑