<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[c_czl的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/c_czl</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; c_czl]]></copyright><item><title><![CDATA[cf1197e dp]]></title><link>https://blog.youkuaiyun.com/c_czl/article/details/103000451</link><guid>https://blog.youkuaiyun.com/c_czl/article/details/103000451</guid><author>c_czl</author><pubDate>Sun, 10 Nov 2019 18:32:15 +0800</pubDate><description><![CDATA[#include &lt;iostream&gt;
#include &lt;cstdio&gt;
#include &lt;algorithm&gt;
#include &lt;cmath&gt;
#include &lt;cstring&gt;

using namespace std;

int n;
long long dp[2][200005][2];

struct node
{
 ...]]></description><category></category></item><item><title><![CDATA[Leetcode 753. Cracking the Safe 双端队列]]></title><link>https://blog.youkuaiyun.com/c_czl/article/details/99686555</link><guid>https://blog.youkuaiyun.com/c_czl/article/details/99686555</guid><author>c_czl</author><pubDate>Fri, 16 Aug 2019 22:23:26 +0800</pubDate><description><![CDATA[lc
]]></description><category></category></item><item><title><![CDATA[Cf1156e 分治+倍增]]></title><link>https://blog.youkuaiyun.com/c_czl/article/details/99239172</link><guid>https://blog.youkuaiyun.com/c_czl/article/details/99239172</guid><author>c_czl</author><pubDate>Sun, 11 Aug 2019 22:29:49 +0800</pubDate><description><![CDATA[考虑区间l，r，最大值在mid（倍增），枚举长度小的一边，然后分治（l，mid-1）（mid+1，r）


#include &lt;iostream&gt;
#include &lt;cstdio&gt;
#include &lt;algorithm&gt;
#include &lt;cstring&gt;
#include &lt;string&gt;
#include &lt;cmath&g...]]></description><category></category></item><item><title><![CDATA[Cf1155d dp+优先队列]]></title><link>https://blog.youkuaiyun.com/c_czl/article/details/99080581</link><guid>https://blog.youkuaiyun.com/c_czl/article/details/99080581</guid><author>c_czl</author><pubDate>Sat, 10 Aug 2019 15:48:36 +0800</pubDate><description><![CDATA[枚举乘x区间的开头i；dp[2][i]表示从i往左往右最大sum；对于每个i要找max&lt;j&gt;(sum(i~j)*x+dp[1][j+1]),考虑优先队列维护

i到i-1时是把所有的sum加上a[i]*x,可以外部用个变量sum维护变化，每次插入一个dp[1][j]-sum;


#include &lt;iostream&gt;
#include &lt;cstdio&gt;
#i...]]></description><category></category></item><item><title><![CDATA[Cf1152 欧拉回路]]></title><link>https://blog.youkuaiyun.com/c_czl/article/details/98788806</link><guid>https://blog.youkuaiyun.com/c_czl/article/details/98788806</guid><author>c_czl</author><pubDate>Wed, 07 Aug 2019 22:04:45 +0800</pubDate><description><![CDATA[https://blog.youkuaiyun.com/qq_37555704/article/details/83347641

无向图建双向边但只能用一个，nxt数组优化当前节点考虑的边号防止反复从头枚举，离散化数组要开大，可能有2*n的-1样例坑


#include &lt;iostream&gt;
#include &lt;cstdio&gt;
#include &lt;algorithm&gt;
...]]></description><category></category></item><item><title><![CDATA[Cf1151f dp+矩阵快速幂]]></title><link>https://blog.youkuaiyun.com/c_czl/article/details/98668164</link><guid>https://blog.youkuaiyun.com/c_czl/article/details/98668164</guid><author>c_czl</author><pubDate>Tue, 06 Aug 2019 22:11:46 +0800</pubDate><description><![CDATA[0有x个，1有y个；定义dp[i][j]:i次时前x位置有j个1的概率；可以从加减不变转移；k很大用矩阵快速幂


#include &lt;iostream&gt;
#include &lt;cstdio&gt;
#include &lt;cstring&gt;
#include &lt;string&gt;
#include &lt;algorithm&gt;
#include &lt;cma...]]></description><category></category></item><item><title><![CDATA[cf1149b dp]]></title><link>https://blog.youkuaiyun.com/c_czl/article/details/98504430</link><guid>https://blog.youkuaiyun.com/c_czl/article/details/98504430</guid><author>c_czl</author><pubDate>Mon, 05 Aug 2019 17:59:09 +0800</pubDate><description><![CDATA[#include&lt;bits/stdc++.h&gt;
using namespace std;
 
typedef long long ll;
const int inf = 0x3f3f3f3f;
int n, q,ch[100010][26];
char s[100010], d[5][255];
int l[5], dp[255][255][255];
int main()
{
	i...]]></description><category></category></item><item><title><![CDATA[cf1148f 构造]]></title><link>https://blog.youkuaiyun.com/c_czl/article/details/98360153</link><guid>https://blog.youkuaiyun.com/c_czl/article/details/98360153</guid><author>c_czl</author><pubDate>Sat, 03 Aug 2019 18:17:43 +0800</pubDate><description><![CDATA[https://blog.youkuaiyun.com/lixuanjing2016/article/details/90756240


#include &lt;iostream&gt;
#include &lt;cstdio&gt;
#include &lt;algorithm&gt;
#include &lt;cstring&gt;
#include &lt;string&gt;
#include &...]]></description><category></category></item><item><title><![CDATA[Cf1144g dp]]></title><link>https://blog.youkuaiyun.com/c_czl/article/details/97903648</link><guid>https://blog.youkuaiyun.com/c_czl/article/details/97903648</guid><author>c_czl</author><pubDate>Wed, 31 Jul 2019 12:20:20 +0800</pubDate><description><![CDATA[dp[i][j][3]:第i个取j(0:增,1:减)的 0:增列最小值，1:减列最大值，2:记录前驱


#include &lt;iostream&gt;
#include &lt;cstdio&gt;
#include &lt;algorithm&gt;
#include &lt;cmath&gt;
#include &lt;cstring&gt;
#include &lt;string&gt...]]></description><category></category></item><item><title><![CDATA[Cf1142b 倍增+离线]]></title><link>https://blog.youkuaiyun.com/c_czl/article/details/97773019</link><guid>https://blog.youkuaiyun.com/c_czl/article/details/97773019</guid><author>c_czl</author><pubDate>Tue, 30 Jul 2019 13:13:40 +0800</pubDate><description><![CDATA[//根据顺序，连向最近下一个，然后倍增，找到长度n的位置，然后离线排序优先队列优先就行了
#include &lt;iostream&gt;
#include &lt;cstdio&gt;
#include &lt;algorithm&gt;
#include &lt;cstring&gt;
#include &lt;cmath&gt;
#include &lt;queue&gt;

using...]]></description><category></category></item><item><title><![CDATA[cf1141f2 greedy]]></title><link>https://blog.youkuaiyun.com/c_czl/article/details/97634404</link><guid>https://blog.youkuaiyun.com/c_czl/article/details/97634404</guid><author>c_czl</author><pubDate>Mon, 29 Jul 2019 12:44:06 +0800</pubDate><description><![CDATA[#include &lt;iostream&gt;
#include &lt;cstdio&gt;
#include &lt;algorithm&gt;
#include &lt;cstring&gt;
#include &lt;cmath&gt;
#include &lt;string&gt;
#include &lt;map&gt;
#include &lt;vector&gt;
using...]]></description><category></category></item><item><title><![CDATA[CF1137C】Museums Tour Tarjan+dp]]></title><link>https://blog.youkuaiyun.com/c_czl/article/details/97560208</link><guid>https://blog.youkuaiyun.com/c_czl/article/details/97560208</guid><author>c_czl</author><pubDate>Sat, 27 Jul 2019 21:41:35 +0800</pubDate><description><![CDATA[https://blog.youkuaiyun.com/rzo_kqp_orz/article/details/88544103
]]></description><category></category></item><item><title><![CDATA[cf1137b kmp]]></title><link>https://blog.youkuaiyun.com/c_czl/article/details/97379740</link><guid>https://blog.youkuaiyun.com/c_czl/article/details/97379740</guid><author>c_czl</author><pubDate>Fri, 26 Jul 2019 12:25:02 +0800</pubDate><description><![CDATA[#include &lt;iostream&gt;
#include &lt;cstdio&gt;
#include &lt;cstring&gt;
#include &lt;cmath&gt;
#include &lt;algorithm&gt;

using namespace std;

char s[500005];
char t[500005];
int nxt[500005];

v...]]></description><category></category></item><item><title><![CDATA[cf1136e sdtree]]></title><link>https://blog.youkuaiyun.com/c_czl/article/details/97317113</link><guid>https://blog.youkuaiyun.com/c_czl/article/details/97317113</guid><author>c_czl</author><pubDate>Thu, 25 Jul 2019 23:28:30 +0800</pubDate><description><![CDATA[https://blog.youkuaiyun.com/heucodesong/article/details/88529248

https://www.cnblogs.com/pkgunboat/p/10527569.html

利用前缀和的前缀和维护
]]></description><category></category></item><item><title><![CDATA[cf1132f dp]]></title><link>https://blog.youkuaiyun.com/c_czl/article/details/97123564</link><guid>https://blog.youkuaiyun.com/c_czl/article/details/97123564</guid><author>c_czl</author><pubDate>Wed, 24 Jul 2019 13:15:06 +0800</pubDate><description><![CDATA[区间dp[i][j]，枚举第一个，i，它可以自己消了，也可以附在后面任何一个相同的上消


#include &lt;iostream&gt;
#include &lt;cstdio&gt;
#include &lt;algorithm&gt;
#include &lt;cstring&gt;
#include &lt;cmath&gt;

using namespace std;

int n;...]]></description><category></category></item><item><title><![CDATA[Cf1129c dp]]></title><link>https://blog.youkuaiyun.com/c_czl/article/details/96982820</link><guid>https://blog.youkuaiyun.com/c_czl/article/details/96982820</guid><author>c_czl</author><pubDate>Tue, 23 Jul 2019 12:27:58 +0800</pubDate><description><![CDATA[dp[i][j]:i到j的串有多少种编码，求和减重复可得答案

dp1[i][j]:以i结尾和以j结尾最长相同的长度，用于处理重复

每次加上以当前j结尾的所有dp，枚举重复结尾求得最长重复长度，减去，前缀数字优化一下。


#include &lt;iostream&gt;
#include &lt;cstdio&gt;
#include &lt;queue&gt;
#include &lt;c...]]></description><category></category></item><item><title><![CDATA[Codeforces 1120C Compress String(DP)]]></title><link>https://blog.youkuaiyun.com/c_czl/article/details/96743968</link><guid>https://blog.youkuaiyun.com/c_czl/article/details/96743968</guid><author>c_czl</author><pubDate>Sun, 21 Jul 2019 18:16:12 +0800</pubDate><description><![CDATA[https://www.cnblogs.com/pkgunboat/p/10664997.html
]]></description><category></category></item><item><title><![CDATA[Cf1114f xdtree bitmark]]></title><link>https://blog.youkuaiyun.com/c_czl/article/details/96464342</link><guid>https://blog.youkuaiyun.com/c_czl/article/details/96464342</guid><author>c_czl</author><pubDate>Thu, 18 Jul 2019 22:57:26 +0800</pubDate><description><![CDATA[维护一个乘积和一个bitmark表示有那些质因子

注意 mp[i]|=(1ll&lt;&lt;j); 1后面加ll；


#include &lt;iostream&gt;
#include &lt;cstdio&gt;
#include &lt;algorithm&gt;
#include &lt;cmath&gt;
#include &lt;cstring&gt;

using namesp...]]></description><category></category></item><item><title><![CDATA[Codeforces 1110D Jongmah （DP）状态限制]]></title><link>https://blog.youkuaiyun.com/c_czl/article/details/96195805</link><guid>https://blog.youkuaiyun.com/c_czl/article/details/96195805</guid><author>c_czl</author><pubDate>Tue, 16 Jul 2019 22:23:41 +0800</pubDate><description><![CDATA[题意：你有n个数字，范围[1, m]，你可以选择其中的三个数字构成一个三元组，但是这三个数字必须是连续的或者相同的，每个数字只能用一次，问这n个数字最多构成多少个三元组?

解析：首先我们容易发现，我们发现，假设有3个三元组（x, x + 1, x + 2),我们不妨把这3个三元组换成(x, x, x), (x + 1, x + 1, x + 1), (x + 2, x + 2, x + 2)这3...]]></description><category></category></item><item><title><![CDATA[CF1108f 并查集]]></title><link>https://blog.youkuaiyun.com/c_czl/article/details/95955346</link><guid>https://blog.youkuaiyun.com/c_czl/article/details/95955346</guid><author>c_czl</author><pubDate>Mon, 15 Jul 2019 13:14:39 +0800</pubDate><description><![CDATA[每种w一起考虑，与同层冲突就加


#include &lt;iostream&gt;
#include &lt;cstdio&gt;
#include &lt;cstring&gt;
#include &lt;string&gt;
#include &lt;algorithm&gt;
#include &lt;queue&gt;

using namespace std;

int n,m;
s...]]></description><category></category></item></channel></rss>