<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[HuanQYYY的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/HuanQYYY</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; HuanQYYY]]></copyright><item><title><![CDATA[kuangbin专题(最短路)做题报告]]></title><link>https://blog.youkuaiyun.com/HuanQYYY/article/details/135150028</link><guid>https://blog.youkuaiyun.com/HuanQYYY/article/details/135150028</guid><author>HuanQYYY</author><pubDate>Fri, 22 Dec 2023 12:10:58 +0800</pubDate><description><![CDATA[题面已全部用中文形式]]></description><category></category></item><item><title><![CDATA[CF1303E Erase Subsequences]]></title><link>https://blog.youkuaiyun.com/HuanQYYY/article/details/129599896</link><guid>https://blog.youkuaiyun.com/HuanQYYY/article/details/129599896</guid><author>HuanQYYY</author><pubDate>Thu, 16 Mar 2023 21:31:11 +0800</pubDate><description><![CDATA[2.设计状态dp[i][j]：s的前i位中包含t1的前j位时最大包含t2的前dp[i][j]位。dp[i+1][j]=dp[i][j]+1（当s[i+1]==t2[dp[i][j]+1]时）；3.边界条件：将所有状态dp[i][j]先赋值为-1，设计初始状态dp[0][0]为0。dp[i+1][j+1]=dp[i][j]（当s[i+1]==t1[j+1]时）；当dp[i][j]==-1时，说明此状态不存在，所以跳过。dp[i+1][j]=dp[i][j]（任何时候）；]]></description><category></category></item></channel></rss>