近期做的一些DP
Posted linkzijun
tags:
篇首语:本文由小常识网(cha138.com)小编为大家整理,主要介绍了近期做的一些DP相关的知识,希望对你有一定的参考价值。
UVa 1625 color length
https://blog.csdn.net/Dylan_Frank/article/details/52261424
https://www.cnblogs.com/jerryRey/p/4740944.html
Uva-1375 The Best Name for Your Baby(未解决)
https://blog.csdn.net/u014258433/article/details/69070747
CodeForces - 17C Balance(DP)
https://blog.csdn.net/u014258433/article/details/53056272
Codeforces D. Minesweeper 1D
https://blog.csdn.net/cc_again/article/details/25063527
leetcode中的DP题目总结
https://blog.csdn.net/littleorange6/article/details/70596439?utm_source=blogxgwz1
BZOJ 3670 - [Noi2014]动物园
https://blog.sengxian.com/solutions/bzoj-3670
「Codeforces 808G」Anthem of Berland - KMP + DP
https://oi.men.ci/cf-808g/
Codeforces 808G Anthem of Berland[dp][kmp]
https://blog.csdn.net/Chyllo/article/details/72730941
https://blog.csdn.net/Dylan_Frank/article/details/52261424
https://www.cnblogs.com/jerryRey/p/4740944.html
Uva-1375 The Best Name for Your Baby(未解决)
https://blog.csdn.net/u014258433/article/details/69070747
CodeForces - 17C Balance(DP)
https://blog.csdn.net/u014258433/article/details/53056272
Codeforces D. Minesweeper 1D
https://blog.csdn.net/cc_again/article/details/25063527
leetcode中的DP题目总结
https://blog.csdn.net/littleorange6/article/details/70596439?utm_source=blogxgwz1
BZOJ 3670 - [Noi2014]动物园
https://blog.sengxian.com/solutions/bzoj-3670
「Codeforces 808G」Anthem of Berland - KMP + DP
https://oi.men.ci/cf-808g/
Codeforces 808G Anthem of Berland[dp][kmp]
https://blog.csdn.net/Chyllo/article/details/72730941
UVA 11584 Partitioning by Palindromes 划分回文串
https://www.cnblogs.com/jerryRey/p/4726739.html
UVA 11400 Lighting System Design 照明系统设计
https://www.cnblogs.com/jerryRey/p/4726716.html
UVA 1220 Party at Hali-Bula (树形DP)
https://www.cnblogs.com/jerryRey/p/4743829.html
UVA 12563 Jin Ge jin Qu [h] ao 劲歌金曲 (01背包)
https://www.cnblogs.com/jerryRey/p/4726582.html
UVa 1025---A Spy in the Metro
https://blog.csdn.net/qq_34374664/article/details/62216624
UVA1626 - Brackets sequence
https://blog.csdn.net/kalilili/article/details/44228527
UVa1412 - Fund Management(状压dp
https://blog.csdn.net/wu_tongtong/article/details/78427995
求合法字符串个数(头条笔试 区间DP
我们定文合法的标1只符为:数字0-9组成的字符串, (可以包合多个前导0)
定义合法的表达式为:
1.若X为合法的标识符,则X为合法的表达式
2.若X为合法的表达式,则(X)为合法的表达式
3.若X和Y均为合法的表达式,则X+Y, X-Y均为合法的表达式
如,以下均合法的表:1, 100, 1+2. (10),1-(3-2)
以下为不合法的表达式: (,-1, 1+-2
给定长度n,求长为n的合法表达式的数目,长为n的合法表达式可能有非常多, 你只需输出结果对1000000007取模的余数即可.
输入描述:一个整数n
输出描述:长度为n的合法表达式的树木对1000000007取模的余数
输入:1
输出10
0<=n<=1000
---------------------
以上是关于近期做的一些DP的主要内容,如果未能解决你的问题,请参考以下文章