<![CDATA[张松超的博客]]>https://blog.csdn.net/ZscDstzh-cnhttps://blog.csdn.net/<![CDATA[Codeforces Round #532 (Div. 2) （A，B，C，D，E，F）]]>https://blog.csdn.net/ZscDst/article/details/88848746https://blog.csdn.net/ZscDst/article/details/88848746ZscDstWed, 27 Mar 2019 17:07:26 +0800<![CDATA[Educational Codeforces Round 62 (Rated for Div. 2) (A,B,C,D,E)]]>https://blog.csdn.net/ZscDst/article/details/88797870https://blog.csdn.net/ZscDst/article/details/88797870ZscDstMon, 25 Mar 2019 17:13:41 +0800<![CDATA[牛客网 ~ 2018年湘潭大学程序设计竞赛G ~ 又见斐波那契 （矩阵快速幂）]]>https://blog.csdn.net/ZscDst/article/details/88310986https://blog.csdn.net/ZscDst/article/details/88310986ZscDstThu, 07 Mar 2019 15:51:27 +0800<![CDATA[UVA ~ 712 ~ S-Trees（二叉树，二进制枚举）]]>https://blog.csdn.net/ZscDst/article/details/85951925https://blog.csdn.net/ZscDst/article/details/85951925ZscDstSun, 06 Jan 2019 21:33:31 +0800<![CDATA[UVA ~ 673 ~ Parentheses Balance （栈，括号配对）]]>https://blog.csdn.net/ZscDst/article/details/85935731https://blog.csdn.net/ZscDst/article/details/85935731ZscDstSun, 06 Jan 2019 16:51:08 +0800<![CDATA[HDU ~ 6273 ~ Master of GCD （差分数组 + 快速幂）]]>https://blog.csdn.net/ZscDst/article/details/85253980https://blog.csdn.net/ZscDst/article/details/85253980ZscDstTue, 25 Dec 2018 20:44:17 +0800<![CDATA[POJ ~ 3263 ~ Tallest Cow（差分数组）]]>https://blog.csdn.net/ZscDst/article/details/85253589https://blog.csdn.net/ZscDst/article/details/85253589ZscDstTue, 25 Dec 2018 20:14:45 +0800<![CDATA[GYM ~ 101775J ~ Straight Master（思维，差分数组）]]>https://blog.csdn.net/ZscDst/article/details/85253125https://blog.csdn.net/ZscDst/article/details/85253125ZscDstTue, 25 Dec 2018 19:41:21 +0800<![CDATA[洛谷 ~ P3948 ~ 数据结构 （差分数组）]]>https://blog.csdn.net/ZscDst/article/details/85233403https://blog.csdn.net/ZscDst/article/details/85233403ZscDstMon, 24 Dec 2018 14:52:29 +0800<![CDATA[洛谷 ~ P1083 ~ 借教室 （差分数组 + 二分）]]>https://blog.csdn.net/ZscDst/article/details/85174817https://blog.csdn.net/ZscDst/article/details/85174817ZscDstFri, 21 Dec 2018 21:35:03 +0800<![CDATA[HDU ~ 1556 ~ Color the ball （差分数组）]]>https://blog.csdn.net/ZscDst/article/details/85172015https://blog.csdn.net/ZscDst/article/details/85172015ZscDstFri, 21 Dec 2018 20:21:52 +0800<![CDATA[洛谷 ~ P2458 [SDOI2006] ~ 保安站岗（树形DP，最小支配集变形）]]>https://blog.csdn.net/ZscDst/article/details/85169749https://blog.csdn.net/ZscDst/article/details/85169749ZscDstFri, 21 Dec 2018 19:18:23 +0800<![CDATA[UVA ~ 1218 ~ Perfect Service （树形dp，最小支配集）]]>https://blog.csdn.net/ZscDst/article/details/85074794https://blog.csdn.net/ZscDst/article/details/85074794ZscDstTue, 18 Dec 2018 19:09:33 +0800<![CDATA[UVA ~ 1292 ~ Strategic game （树的最小点覆盖）]]>https://blog.csdn.net/ZscDst/article/details/85004551https://blog.csdn.net/ZscDst/article/details/85004551ZscDstFri, 14 Dec 2018 15:29:24 +0800<![CDATA[洛谷 ~ P2014 ~ 选课 （树形背包）]]>https://blog.csdn.net/ZscDst/article/details/85002210https://blog.csdn.net/ZscDst/article/details/85002210ZscDstFri, 14 Dec 2018 13:34:06 +0800<![CDATA[HDU ~ 4745 ~ Two Rabbits （区间DP，环形序列的最长回文子序列）]]>https://blog.csdn.net/ZscDst/article/details/84989839https://blog.csdn.net/ZscDst/article/details/84989839ZscDstThu, 13 Dec 2018 15:47:48 +0800<![CDATA[HDU ~ 4632 ~ Palindrome subsequence（区间DP，容斥，回文子序列个数）]]>https://blog.csdn.net/ZscDst/article/details/84979655https://blog.csdn.net/ZscDst/article/details/84979655ZscDstWed, 12 Dec 2018 21:21:59 +0800<![CDATA[POJ ~ 3280 ~ Cheapest Palindrome（区间DP，变为回文子序列最小代价）]]>https://blog.csdn.net/ZscDst/article/details/84978927https://blog.csdn.net/ZscDst/article/details/84978927ZscDstWed, 12 Dec 2018 20:29:47 +0800<![CDATA[Codeforces ~ 1083A ~ The Fair Nut and the Best Path（树形DP，树的直径）]]>https://blog.csdn.net/ZscDst/article/details/84977135https://blog.csdn.net/ZscDst/article/details/84977135ZscDstWed, 12 Dec 2018 18:07:19 +0800<![CDATA[HDU ~ 2476 ~ String painter（区间DP，好题）]]>https://blog.csdn.net/ZscDst/article/details/84960582https://blog.csdn.net/ZscDst/article/details/84960582ZscDstTue, 11 Dec 2018 19:40:44 +0800