<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[banggui5839的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/banggui5839</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; banggui5839]]></copyright><item><title><![CDATA[Linux learning jottings(2)-static or dynamic library]]></title><link>https://blog.youkuaiyun.com/banggui5839/article/details/101911452</link><guid>https://blog.youkuaiyun.com/banggui5839/article/details/101911452</guid><author>banggui5839</author><pubDate>Sat, 02 Apr 2016 16:03:00 +0800</pubDate><description><![CDATA[Linux learning jottings(2)-static or dynamic library

        
	
        
            

    function library is divided into static library and dynamic library.

0x00. stat...]]></description><category></category></item><item><title><![CDATA[Linux learning jottings(1)-system directory]]></title><link>https://blog.youkuaiyun.com/banggui5839/article/details/101911450</link><guid>https://blog.youkuaiyun.com/banggui5839/article/details/101911450</guid><author>banggui5839</author><pubDate>Sat, 02 Apr 2016 15:09:00 +0800</pubDate><description><![CDATA[Linux learning jottings(1)-system directory

        
	
        
            

    System directory

directories under "/"

/bin/: to store user command, a little similar w...]]></description><category></category></item><item><title><![CDATA[uvalive-6190(二分+dp验证)]]></title><link>https://blog.youkuaiyun.com/banggui5839/article/details/101911451</link><guid>https://blog.youkuaiyun.com/banggui5839/article/details/101911451</guid><author>banggui5839</author><pubDate>Sun, 08 Nov 2015 13:00:00 +0800</pubDate><description><![CDATA[uvalive-6190(二分+dp验证)

        
	
        
            

    Beautiful Spacing
链接
题意：
　　文本每行有w列，有n个单词。排列规则如下：
　　1、每两个单词之间必须有空格
　　2、除了最后一行，每行第一个单词第一个字母必须顶格，最后一个单词最后一个字母...]]></description><category></category></item><item><title><![CDATA[HZAU-Training-11-4(for 2015th)]]></title><link>https://blog.youkuaiyun.com/banggui5839/article/details/101911447</link><guid>https://blog.youkuaiyun.com/banggui5839/article/details/101911447</guid><author>banggui5839</author><pubDate>Sat, 07 Nov 2015 23:05:00 +0800</pubDate><description><![CDATA[HZAU-Training-11-4(for 2015th)

        
	
        
            

    A:
　　多少a*a的正方形能够覆盖m*n的矩形。
　　长用多少覆盖，宽用多少覆盖，向上取整乘起来。注意爆int


1 #include &lt;bits/stdc++.h&gt;
2 
...]]></description><category></category></item><item><title><![CDATA[hdu4099(Trie)]]></title><link>https://blog.youkuaiyun.com/banggui5839/article/details/101911448</link><guid>https://blog.youkuaiyun.com/banggui5839/article/details/101911448</guid><author>banggui5839</author><pubDate>Thu, 05 Nov 2015 17:16:00 +0800</pubDate><description><![CDATA[hdu4099(Trie)

        
	
        
            

    题意：
　　给定一个长度不超过40的数字串s，求斐波那契数列的前十万项中，最小的一个前缀为s的数的下标。
解决：
　　高精度算出前十万个斐波那契数，每个取前40位，建trie，查询O(40)
（本地建立Trie跑了20s，让我知道...]]></description><category></category></item><item><title><![CDATA[hdu4091(贪心枚举)]]></title><link>https://blog.youkuaiyun.com/banggui5839/article/details/101911443</link><guid>https://blog.youkuaiyun.com/banggui5839/article/details/101911443</guid><author>banggui5839</author><pubDate>Wed, 04 Nov 2015 21:52:00 +0800</pubDate><description><![CDATA[hdu4091(贪心枚举)

        
	
        
            

    题意：
　　给两种宝石，体积S1,S2，价值V1,V2，背包容量n，求最大收益
解决：
　　题目没有给数据范围，不过显然不能背包。
　　先考虑性价，假设宝石1性价比高于宝石2，则宝石2最多不可能拿超过lcm(s1, s2) / s...]]></description><category></category></item><item><title><![CDATA[poj1276(多重背包)]]></title><link>https://blog.youkuaiyun.com/banggui5839/article/details/101911441</link><guid>https://blog.youkuaiyun.com/banggui5839/article/details/101911441</guid><author>banggui5839</author><pubDate>Wed, 04 Nov 2015 20:52:00 +0800</pubDate><description><![CDATA[poj1276(多重背包)

        
	
        
            

    
 1 #include &lt;cstdio&gt;
 2 #include &lt;cstring&gt;
 3 
 4 const int MAXN = 1e5+10;
 5 
 6 bool dp[MAXN];
 7...]]></description><category></category></item><item><title><![CDATA[2015-11-1-Training(for 2015th)]]></title><link>https://blog.youkuaiyun.com/banggui5839/article/details/101911446</link><guid>https://blog.youkuaiyun.com/banggui5839/article/details/101911446</guid><author>banggui5839</author><pubDate>Wed, 04 Nov 2015 09:42:00 +0800</pubDate><description><![CDATA[2015-11-1-Training(for 2015th)

        
	
        
            

    A：(hdu2081)
Solution:
　　get the last five digits, not mod 100000 cause the leading zero.

B:(hdu2...]]></description><category></category></item><item><title><![CDATA[2015-11-3-Training(for 2014th)]]></title><link>https://blog.youkuaiyun.com/banggui5839/article/details/101911444</link><guid>https://blog.youkuaiyun.com/banggui5839/article/details/101911444</guid><author>banggui5839</author><pubDate>Tue, 03 Nov 2015 22:14:00 +0800</pubDate><description><![CDATA[2015-11-3-Training(for 2014th)

        
	
        
            

    A:(hdu1081)
题意：
　　求和最大的子矩阵
解决：
　　先考虑一维数组，可以O(n)复杂度求出 和值最大的连续子序列。
　　同理，对每一行维护前缀和，然后枚举从 l 列到 r 列，每行...]]></description><category></category></item><item><title><![CDATA[hdu3718(二分图最大权匹配，模板题)]]></title><link>https://blog.youkuaiyun.com/banggui5839/article/details/101911439</link><guid>https://blog.youkuaiyun.com/banggui5839/article/details/101911439</guid><author>banggui5839</author><pubDate>Tue, 03 Nov 2015 18:10:00 +0800</pubDate><description><![CDATA[hdu3718(二分图最大权匹配，模板题)

        
	
        
            

    题意：
　　给定模板序列，和m个代考察序列，求出每个序列和模板序列的相似度。
　　其中相似度的定义：待考察序列中的相同字母，均可以替换成其他相同字母。例如 A B A A C 可以替换成 B B B B C 或者 C ...]]></description><category></category></item><item><title><![CDATA[hdu3714（三分）]]></title><link>https://blog.youkuaiyun.com/banggui5839/article/details/101911442</link><guid>https://blog.youkuaiyun.com/banggui5839/article/details/101911442</guid><author>banggui5839</author><pubDate>Tue, 03 Nov 2015 18:02:00 +0800</pubDate><description><![CDATA[hdu3714（三分）

        
	
        
            

    题意：
　　n个二次函数，求定义域[0, 1000]时候每个函数的最小值当中的最大值。精确到1e-4
解决：
　　三分，eps = 1e-9能过，因为二次函数的函数值精确到1e-4所以自变量x精确度必须高于1e-8


 1 #...]]></description><category></category></item><item><title><![CDATA[CF DP]]></title><link>https://blog.youkuaiyun.com/banggui5839/article/details/101911440</link><guid>https://blog.youkuaiyun.com/banggui5839/article/details/101911440</guid><author>banggui5839</author><pubDate>Sun, 01 Nov 2015 12:15:00 +0800</pubDate><description><![CDATA[CF DP

        
	
        
            

    http://codeforces.com/problemset/problem/183/D




    
    
    

        
	
        
            posted on 
2015-11-01 12:15...]]></description><category></category></item><item><title><![CDATA[hdu 3998]]></title><link>https://blog.youkuaiyun.com/banggui5839/article/details/101911437</link><guid>https://blog.youkuaiyun.com/banggui5839/article/details/101911437</guid><author>banggui5839</author><pubDate>Sat, 31 Oct 2015 00:05:00 +0800</pubDate><description><![CDATA[hdu 3998

        
	
        
            

    统计不相交LIS个数
MAX FLOW
dinic...太慢了，SAP竟然0ms
dp直接n2去做，记录每个元素结尾的LIS长度
建图的时候，dp[i]=1的与源点建图，dp[i]=LIS的与汇点建图，dp[i] == dp[j] + 1...]]></description><category></category></item><item><title><![CDATA[hdu2255 KM模板]]></title><link>https://blog.youkuaiyun.com/banggui5839/article/details/101911435</link><guid>https://blog.youkuaiyun.com/banggui5839/article/details/101911435</guid><author>banggui5839</author><pubDate>Fri, 09 Oct 2015 19:02:00 +0800</pubDate><description><![CDATA[hdu2255 KM模板

        
	
        
            

    
#include &lt;cstdio&gt;
#include &lt;cstring&gt;
#include &lt;algorithm&gt;

const int MAXN = 300+10;
const int I...]]></description><category></category></item><item><title><![CDATA[poj 1741 树分治]]></title><link>https://blog.youkuaiyun.com/banggui5839/article/details/101911438</link><guid>https://blog.youkuaiyun.com/banggui5839/article/details/101911438</guid><author>banggui5839</author><pubDate>Wed, 19 Aug 2015 11:33:00 +0800</pubDate><description><![CDATA[poj 1741 树分治

        
	
        
            

    题意：
　　求树上距离不超过k的点对数
解决：
　　很经典的树分治
　　先不考虑树退化的情况。
　　对每个节点u，假设u有x个子节点，v1 v2 v3 .. vx，求出以u为根的子树上，所有不属于同一个v节点的，且距离不大于k的点...]]></description><category></category></item><item><title><![CDATA[Commen]]></title><link>https://blog.youkuaiyun.com/banggui5839/article/details/101911445</link><guid>https://blog.youkuaiyun.com/banggui5839/article/details/101911445</guid><author>banggui5839</author><pubDate>Wed, 19 Aug 2015 01:37:00 +0800</pubDate><description><![CDATA[Commen

        
	
        
            

    
std::lower_bound(first, last, val) // 返回从左到右第一个大于等于val的位置
std::upper_bound(first, last, val) // 返回从左到右第一个大于val的位置






...]]></description><category></category></item><item><title><![CDATA[hdu 2196(树上点分治）]]></title><link>https://blog.youkuaiyun.com/banggui5839/article/details/101911433</link><guid>https://blog.youkuaiyun.com/banggui5839/article/details/101911433</guid><author>banggui5839</author><pubDate>Wed, 12 Aug 2015 23:19:00 +0800</pubDate><description><![CDATA[hdu 2196(树上点分治）

        
	
        
            

    题意：
　　n个节点无根树，求从每个节点出发的最长链
解决：
　　最长链有两种可能：1、以自身为根的子树上，从根到叶子节点的某条链。 2、 从自己出发，向上到父节点，加上父节点的最长链。
　　但是第二种情况有很多问题，首先，如...]]></description><category></category></item><item><title><![CDATA[A+B]]></title><link>https://blog.youkuaiyun.com/banggui5839/article/details/101911431</link><guid>https://blog.youkuaiyun.com/banggui5839/article/details/101911431</guid><author>banggui5839</author><pubDate>Mon, 10 Aug 2015 19:46:00 +0800</pubDate><description><![CDATA[A+B

        
	
        
            

    太无聊，就AC了一次A+B。



 1 #include &lt;bits/stdc++.h&gt;
 2 #define _____ int
 3 #define ___ ;
 4 #define ______ main
 5 #def...]]></description><category></category></item><item><title><![CDATA[hdu 4807（网络流 + 贪心）]]></title><link>https://blog.youkuaiyun.com/banggui5839/article/details/101911436</link><guid>https://blog.youkuaiyun.com/banggui5839/article/details/101911436</guid><author>banggui5839</author><pubDate>Sat, 08 Aug 2015 18:29:00 +0800</pubDate><description><![CDATA[hdu 4807（网络流 + 贪心）

        
	
        
            

    题意：
　　n个点（0 到 n-1）， m条边，每条边花费都是1，容量不同， 有k个人在0点，问，最少需要多少时间所有人能走到点n-1
解决：
　　建图，跑费用流的过程中贪心一下。
　　策略如下：
　　　　
　　　...]]></description><category></category></item><item><title><![CDATA[hdu4101]]></title><link>https://blog.youkuaiyun.com/banggui5839/article/details/101911429</link><guid>https://blog.youkuaiyun.com/banggui5839/article/details/101911429</guid><author>banggui5839</author><pubDate>Sun, 26 Jul 2015 23:27:00 +0800</pubDate><description><![CDATA[hdu4101

        
	
        
            

    
题意：
　　一个矩阵中 -1代表宝藏，0代表通路，其他正整数代表石头。两个人轮流采取操作：从矩阵外面任何地方进如矩阵，对可以到达的石头进行一次攻击，石头将掉一血，若石头掉为0血，则此处变为通路。问必胜方

解决：
　　设有某一圈石头围...]]></description><category></category></item></channel></rss>