<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[LKC1999的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/LKC1999</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; LKC1999]]></copyright><item><title><![CDATA[HNOI 2013 bzoj 3144 切糕]]></title><link>https://blog.youkuaiyun.com/LKC1999/article/details/50723939</link><guid>https://blog.youkuaiyun.com/LKC1999/article/details/50723939</guid><author>LKC1999</author><pubDate>Tue, 23 Feb 2016 16:09:35 +0800</pubDate><description><![CDATA[代价拆点做一个最小割
/**************************************************************
    Problem: 3144
    User: Clare
    Language: C++
    Result: Accepted
    Time:904 ms
    Memory:14304 kb
***************]]></description><category></category></item><item><title><![CDATA[HNOI 2013 bzoj 3142 数列]]></title><link>https://blog.youkuaiyun.com/LKC1999/article/details/50723863</link><guid>https://blog.youkuaiyun.com/LKC1999/article/details/50723863</guid><author>LKC1999</author><pubDate>Tue, 23 Feb 2016 16:02:06 +0800</pubDate><description><![CDATA[推个公式就行了，但是不懂为什么换成unsigned long long 就挂了
/**************************************************************
    Problem: 3142
    User: Clare
    Language: C++
    Result: Accepted
    Time:0 ms
    Memo]]></description><category></category></item><item><title><![CDATA[bzoj 4134 ljw和lzr的hack比赛]]></title><link>https://blog.youkuaiyun.com/LKC1999/article/details/50721395</link><guid>https://blog.youkuaiyun.com/LKC1999/article/details/50721395</guid><author>LKC1999</author><pubDate>Tue, 23 Feb 2016 10:46:46 +0800</pubDate><description><![CDATA[Trie树维护Sg值，类似线段树合并的方式合并子树，复杂度 O（nlog(n))
/**************************************************************
    Problem: 4134
    User: Clare
    Language: C++
    Result: Accepted
    Time:1988 ms]]></description><category></category></item><item><title><![CDATA[HNOI 2013 bzoj 3143 游走]]></title><link>https://blog.youkuaiyun.com/LKC1999/article/details/50719385</link><guid>https://blog.youkuaiyun.com/LKC1999/article/details/50719385</guid><author>LKC1999</author><pubDate>Mon, 22 Feb 2016 22:21:48 +0800</pubDate><description><![CDATA[每条边期望经过次数 w[i]=x[u]/d[u]+x[v]/d[v]  
x[i]为点i期望经过次数，d[i]为i出度数
列出关于x的方程，高斯消元解决
/**************************************************************
    Problem: 3143
    User: Clare
    Language: C++
    ]]></description><category></category></item><item><title><![CDATA[HNOI 2013 bzoj 3141 旅行]]></title><link>https://blog.youkuaiyun.com/LKC1999/article/details/50719365</link><guid>https://blog.youkuaiyun.com/LKC1999/article/details/50719365</guid><author>LKC1999</author><pubDate>Mon, 22 Feb 2016 22:15:47 +0800</pubDate><description><![CDATA[这个题目我不会看别人的代码，那个正负问题我给满分
/**************************************************************
    Problem: 3141
    User: Clare
    Language: C++
    Result: Accepted
    Time:1872 ms
    Memory:54008 kb
]]></description><category></category></item><item><title><![CDATA[HNOI 2013 bzoj 3140 消毒]]></title><link>https://blog.youkuaiyun.com/LKC1999/article/details/50719351</link><guid>https://blog.youkuaiyun.com/LKC1999/article/details/50719351</guid><author>LKC1999</author><pubDate>Mon, 22 Feb 2016 22:13:03 +0800</pubDate><description><![CDATA[暴力一维，剩下两维做一个最小点覆盖
要注意memset的复杂度问题！
/**************************************************************
    Problem: 3140
    User: Clare
    Language: C++
    Result: Accepted
    Time:1160 ms
    Memor]]></description><category></category></item><item><title><![CDATA[HNIO 2013 bzoj 3139 比赛]]></title><link>https://blog.youkuaiyun.com/LKC1999/article/details/50708636</link><guid>https://blog.youkuaiyun.com/LKC1999/article/details/50708636</guid><author>LKC1999</author><pubDate>Sun, 21 Feb 2016 16:51:35 +0800</pubDate><description><![CDATA[爆搜加减枝，取模真是可怕800ms 和 tle 的区别
/**************************************************************
    Problem: 3139
    User: Clare
    Language: C++
    Result: Accepted
    Time:852 ms
    Memory:2336 kb]]></description><category></category></item><item><title><![CDATA[hdu 5470 Typewriter]]></title><link>https://blog.youkuaiyun.com/LKC1999/article/details/50677279</link><guid>https://blog.youkuaiyun.com/LKC1999/article/details/50677279</guid><author>LKC1999</author><pubDate>Tue, 16 Feb 2016 22:55:17 +0800</pubDate><description><![CDATA[Dp ／单调性／SAM ／更新节点(这个好坑啊)
#include 
#include 
#include 
#include 
#include 
#include 
#include 
using namespace std;

#define N 100010
#define INF 1000000000000000000LL

char S[N];
int c[N],Case,hehe;]]></description><category></category></item><item><title><![CDATA[bzoj 3238 差异]]></title><link>https://blog.youkuaiyun.com/LKC1999/article/details/50676682</link><guid>https://blog.youkuaiyun.com/LKC1999/article/details/50676682</guid><author>LKC1999</author><pubDate>Tue, 16 Feb 2016 20:17:22 +0800</pubDate><description><![CDATA[/**************************************************************
    Problem: 3238
    User: Clare
    Language: C++
    Result: Accepted
    Time:2912 ms
    Memory:132624 kb
*************************]]></description><category></category></item><item><title><![CDATA[bzoj 2555 Substring]]></title><link>https://blog.youkuaiyun.com/LKC1999/article/details/50670434</link><guid>https://blog.youkuaiyun.com/LKC1999/article/details/50670434</guid><author>LKC1999</author><pubDate>Mon, 15 Feb 2016 21:50:19 +0800</pubDate><description><![CDATA[SAM的下标我一直都是从0开始，结果带入LCT就挂了，而且蜜汁MLE，找了好久才发现，交了好多遍
/**************************************************************
    Problem: 2555
    User: Clare
    Language: C++
    Result: Accepted
    Time:1527]]></description><category></category></item></channel></rss>