<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[Hardbird]]></title><description><![CDATA[别低头， 王冠会掉。 别流泪， 坏人会笑。新博客 hardbird.net]]></description><link>https://blog.youkuaiyun.com/u014435976</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; u014435976]]></copyright><item><title><![CDATA[POJ - 1273 Drainage Ditches(最大流)]]></title><link>https://blog.youkuaiyun.com/u014435976/article/details/41487611</link><guid>https://blog.youkuaiyun.com/u014435976/article/details/41487611</guid><author>u014435976</author><pubDate>Tue, 25 Nov 2014 19:25:22 +0800</pubDate><description><![CDATA[裸的最大流，贴上刘汝佳紫书上的模板就能过。


#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
using namespace std;
const int maxn=420;
const int INF=0x3f3f3f3f;
struct Edge
{
    int from]]></description><category></category></item><item><title><![CDATA[UVA - 11992 Fast Matrix Operations(线段树)]]></title><link>https://blog.youkuaiyun.com/u014435976/article/details/41379419</link><guid>https://blog.youkuaiyun.com/u014435976/article/details/41379419</guid><author>u014435976</author><pubDate>Sat, 22 Nov 2014 10:37:49 +0800</pubDate><description><![CDATA[对于一个r*c的矩阵]]></description><category></category></item><item><title><![CDATA[HDU - 3397 Sequence operation(线段树)]]></title><link>https://blog.youkuaiyun.com/u014435976/article/details/41324573</link><guid>https://blog.youkuaiyun.com/u014435976/article/details/41324573</guid><author>u014435976</author><pubDate>Thu, 20 Nov 2014 23:09:47 +0800</pubDate><description><![CDATA[这个题确实不该说难，]]></description><category></category></item><item><title><![CDATA[HDU - 3308 LCIS(线段树)]]></title><link>https://blog.youkuaiyun.com/u014435976/article/details/41314531</link><guid>https://blog.youkuaiyun.com/u014435976/article/details/41314531</guid><author>u014435976</author><pubDate>Thu, 20 Nov 2014 15:52:05 +0800</pubDate><description><![CDATA[区间]]></description><category></category></item><item><title><![CDATA[POJ - 3667 Hotel(线段树)]]></title><link>https://blog.youkuaiyun.com/u014435976/article/details/41283647</link><guid>https://blog.youkuaiyun.com/u014435976/article/details/41283647</guid><author>u014435976</author><pubDate>Wed, 19 Nov 2014 16:21:32 +0800</pubDate><description><![CDATA[区间合并问题]]></description><category></category></item><item><title><![CDATA[POJ - 2528 Mayor's posters(线段树)]]></title><link>https://blog.youkuaiyun.com/u014435976/article/details/41212919</link><guid>https://blog.youkuaiyun.com/u014435976/article/details/41212919</guid><author>u014435976</author><pubDate>Mon, 17 Nov 2014 17:52:18 +0800</pubDate><description><![CDATA[先把所有的值离散化，因为是]]></description><category></category></item><item><title><![CDATA[POJ - 2886 Who Gets the Most Candies?(线段树)]]></title><link>https://blog.youkuaiyun.com/u014435976/article/details/41207359</link><guid>https://blog.youkuaiyun.com/u014435976/article/details/41207359</guid><author>u014435976</author><pubDate>Mon, 17 Nov 2014 12:38:37 +0800</pubDate><description><![CDATA[这个题思路很容易]]></description><category></category></item><item><title><![CDATA[HDU - 5105 Math Problem]]></title><link>https://blog.youkuaiyun.com/u014435976/article/details/41180213</link><guid>https://blog.youkuaiyun.com/u014435976/article/details/41180213</guid><author>u014435976</author><pubDate>Sun, 16 Nov 2014 22:17:25 +0800</pubDate><description><![CDATA[高中数学问题。不过学会了一个技巧，对于]]></description><category></category></item><item><title><![CDATA[HDU - 5101 Select]]></title><link>https://blog.youkuaiyun.com/u014435976/article/details/41176111</link><guid>https://blog.youkuaiyun.com/u014435976/article/details/41176111</guid><author>u014435976</author><pubDate>Sun, 16 Nov 2014 20:08:28 +0800</pubDate><description><![CDATA[题目大意：
给定一些集合，选择两个来自不同集合的数，加和大于k，问有多少种选择方案。
解题思路：
答案=从所有数中选择的两个加和大于k的数的方案数-在同一个集合中选择的两个加和大于k的数的方案数
而对于同一个集合中选择的两个加和大于k的方案数是可以直接排序然后利用单调性快速统计出来的。]]></description><category></category></item><item><title><![CDATA[POJ - 2828 Buy Tickets(线段树)]]></title><link>https://blog.youkuaiyun.com/u014435976/article/details/41171721</link><guid>https://blog.youkuaiyun.com/u014435976/article/details/41171721</guid><author>u014435976</author><pubDate>Sun, 16 Nov 2014 12:08:25 +0800</pubDate><description><![CDATA[把插队的顺序从后往前进行]]></description><category></category></item><item><title><![CDATA[ZOJ - 3805 Machine]]></title><link>https://blog.youkuaiyun.com/u014435976/article/details/41149753</link><guid>https://blog.youkuaiyun.com/u014435976/article/details/41149753</guid><author>u014435976</author><pubDate>Sat, 15 Nov 2014 20:38:12 +0800</pubDate><description><![CDATA[可以看做是简单的DAG图]]></description><category></category></item><item><title><![CDATA[ZOJ - 3804 YY's Minions(模拟)]]></title><link>https://blog.youkuaiyun.com/u014435976/article/details/41148215</link><guid>https://blog.youkuaiyun.com/u014435976/article/details/41148215</guid><author>u014435976</author><pubDate>Sat, 15 Nov 2014 18:32:47 +0800</pubDate><description><![CDATA[很水的一个模拟。]]></description><category></category></item><item><title><![CDATA[POJ - 3468 A Simple Problem with Integers(线段树)]]></title><link>https://blog.youkuaiyun.com/u014435976/article/details/41125673</link><guid>https://blog.youkuaiyun.com/u014435976/article/details/41125673</guid><author>u014435976</author><pubDate>Fri, 14 Nov 2014 22:03:02 +0800</pubDate><description><![CDATA[成段增减，区间求和。


#include 
#include 
using namespace std;
#define lson l,mid,rt<<1
#define rson mid+1,r,rt<<1|1
typedef long long LL;
const int maxn=110000;
LL sum[maxn<<2], col[maxn<<2];
void pushup(i]]></description><category></category></item><item><title><![CDATA[HDU - 1698 Just a Hook(线段树)]]></title><link>https://blog.youkuaiyun.com/u014435976/article/details/41117265</link><guid>https://blog.youkuaiyun.com/u014435976/article/details/41117265</guid><author>u014435976</author><pubDate>Fri, 14 Nov 2014 13:14:10 +0800</pubDate><description><![CDATA[成段修改。]]></description><category></category></item><item><title><![CDATA[POJ - 3974 Palindrome(Manacher算法模板题)]]></title><link>https://blog.youkuaiyun.com/u014435976/article/details/41114931</link><guid>https://blog.youkuaiyun.com/u014435976/article/details/41114931</guid><author>u014435976</author><pubDate>Fri, 14 Nov 2014 10:48:59 +0800</pubDate><description><![CDATA[我就是来存个模板]]></description><category></category></item><item><title><![CDATA[HDU - 4965 Fast Matrix Calculation]]></title><link>https://blog.youkuaiyun.com/u014435976/article/details/41088847</link><guid>https://blog.youkuaiyun.com/u014435976/article/details/41088847</guid><author>u014435976</author><pubDate>Thu, 13 Nov 2014 21:36:36 +0800</pubDate><description><![CDATA[很简单的一步推倒，(AB)^(n^2)=A(BA)^(n^2-1)B，这样]]></description><category></category></item><item><title><![CDATA[HDU - 1394 Minimum Inversion Number(线段树 | 树状数组)]]></title><link>https://blog.youkuaiyun.com/u014435976/article/details/41083437</link><guid>https://blog.youkuaiyun.com/u014435976/article/details/41083437</guid><author>u014435976</author><pubDate>Thu, 13 Nov 2014 17:41:31 +0800</pubDate><description><![CDATA[求逆序对数。


线段树]]></description><category></category></item><item><title><![CDATA[HDU - 1754 I Hate It(线段树)]]></title><link>https://blog.youkuaiyun.com/u014435976/article/details/41083279</link><guid>https://blog.youkuaiyun.com/u014435976/article/details/41083279</guid><author>u014435976</author><pubDate>Thu, 13 Nov 2014 17:32:24 +0800</pubDate><description><![CDATA[单点修改，区间最值。]]></description><category></category></item><item><title><![CDATA[HDU - 1166 敌兵布阵 (线段树)]]></title><link>https://blog.youkuaiyun.com/u014435976/article/details/41083125</link><guid>https://blog.youkuaiyun.com/u014435976/article/details/41083125</guid><author>u014435976</author><pubDate>Thu, 13 Nov 2014 17:26:29 +0800</pubDate><description><![CDATA[单点更改增减，区间球和。]]></description><category></category></item><item><title><![CDATA[HDU 4035 Maze(概率dp)]]></title><link>https://blog.youkuaiyun.com/u014435976/article/details/40951427</link><guid>https://blog.youkuaiyun.com/u014435976/article/details/40951427</guid><author>u014435976</author><pubDate>Sun, 09 Nov 2014 17:32:17 +0800</pubDate><description><![CDATA[这个]]></description><category></category></item></channel></rss>