![](https://img-blog.csdnimg.cn/20201014180756916.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
DP
文章平均质量分 80
YuriHehehe
这个作者很懒,什么都没留下…
展开
-
CodeForces 603A_Alternative Thinking (DP)
#include using namespace std; int n; const int MAXN = 1e5 + 10; char bin[MAXN]; int dp[MAXN][2][3];//0未1翻2远离 int lst; int maxLen; int nowLen; int Max(int a, int b){ return a > b ? a : b; } int main()原创 2016-01-19 20:53:21 · 293 阅读 · 0 评论 -
CodeForces 602B_Approximating a Constant Range_DP
Description When Xellos was doing a practice course in university, he once had to measure the intensity of an effect that slowly approached equilibrium. A good way to determine the equilibrium inte原创 2016-01-19 21:06:23 · 260 阅读 · 0 评论 -
CodeForces 597C_Subsequences
Description For the given sequence with n different elements find the number of increasing subsequences with k + 1 elements. It is guaranteed that the answer is not greater than 8·1018. In原创 2016-01-19 21:15:13 · 244 阅读 · 0 评论