2018年6月29日
Educational Codeforces Round 46 (Rated for Div. 2) D. Yet Another Problem On a Subsequence
摘要： 这个题是dp, dp[i]代表以i开始的符合要求的字符串数 j是我们列举出的i之后一个字符串的开始地址，这里的C是组合数 dp[i] += C(j i 1, A[i]] ) dp[j]; include include include include include include include 阅读全文
posted @ 2018-06-29 21:10 basasuya 阅读(204) 评论(0) 推荐(0) 编辑