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