假装自己复活辣。 7.10 CF 689 D Friends and Subsequences 二分。 1 #include <iostream> 2 #include <cstdio> 3 #include <algorithm> 4 using namespace std; 5 typedef ...
分类：
其他好文 时间：
2016-07-10 16:31:22
阅读次数：
222
D. Friends and Subsequences D. Friends and Subsequences Mike and !Mike are old childhood rivals, they are opposite in everything they do, except progr ...
分类：
其他好文 时间：
2016-07-09 22:13:46
阅读次数：
177
Find the nondecreasing subsequences Time Limit: 10000/5000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1844 Accepte ...
分类：
编程语言 时间：
2016-07-09 20:42:42
阅读次数：
205
Firt thought: an variation to LCS problem - but this one has many tricky detail. I learnt the solution from this link:https://github.com/wangyongliang ...
分类：
其他好文 时间：
2016-06-18 10:17:16
阅读次数：
170
Distinct Subsequences
Total Accepted: 51556 Total
Submissions: 177996 Difficulty: Hard
Given a string S and a string T, count the number of distinct subsequences of T in S.
...
分类：
其他好文 时间：
2016-05-30 14:59:05
阅读次数：
211
Given a string S and a string T, count the number of distinct subsequences of T in S. A subsequence of a string is a new string which is formed from t ...
分类：
其他好文 时间：
2016-05-25 22:00:13
阅读次数：
147
前缀和. 设f[i]为前缀和%7=i的第一个点。那么答案就是max(i-f[s[i]%7])了。 #include #include #include using namespace std; const int maxn = 50000 + 10; int a[maxn],s[maxn]; int... ...
分类：
其他好文 时间：
2016-05-20 22:15:54
阅读次数：
121
Given a string S and a string T, count the number of distinct subsequences of T in S. A subsequence of a string is a new string which is formed from t ...
分类：
其他好文 时间：
2016-04-30 14:07:46
阅读次数：
119
Folding Description Bill is trying to compactly represent sequences of capital alphabetic characters from `A' to `Z' by folding repeating subsequences ...
分类：
其他好文 时间：
2016-04-27 00:11:00
阅读次数：
204
