<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[NeighThorn的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/neighthorn</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; neighthorn]]></copyright><item><title><![CDATA[Spring学习——IOC&DI学习笔记]]></title><link>https://blog.youkuaiyun.com/neighthorn/article/details/108972919</link><guid>https://blog.youkuaiyun.com/neighthorn/article/details/108972919</guid><author>neighthorn</author><pubDate>Fri, 09 Oct 2020 09:38:40 +0800</pubDate><description><![CDATA[Spring学习——IOC&amp;DI学习笔记
SOLID：面向对象设计的五个基本原则

S：单一职责原则(Single-Responsibility Principle)

定义：对于一个类而言，应该只有一个能够引起它变化的原因，也就是一个类只做一件事
为什么要遵循SPR：

减少类之间的耦合：当需求变化的时候，只修改一个类，从而隔离了变化
提高类的复用性




O：开放-封闭原则(Open-Closed Principle)

Open for extension：模块的行为是开放的，可扩展的
Cl]]></description><category></category></item><item><title><![CDATA[NOIP 2008 双栈排序 二分图]]></title><link>https://blog.youkuaiyun.com/neighthorn/article/details/53162817</link><guid>https://blog.youkuaiyun.com/neighthorn/article/details/53162817</guid><author>neighthorn</author><pubDate>Mon, 14 Nov 2016 19:23:01 +0800</pubDate><description><![CDATA[二分图]]></description><category></category></item><item><title><![CDATA[BZOJ 1127: [POI2008]KUP 最大子矩阵]]></title><link>https://blog.youkuaiyun.com/neighthorn/article/details/53141942</link><guid>https://blog.youkuaiyun.com/neighthorn/article/details/53141942</guid><author>neighthorn</author><pubDate>Sat, 12 Nov 2016 17:34:59 +0800</pubDate><description><![CDATA[最大子矩阵]]></description><category></category></item><item><title><![CDATA[BZOJ 1142: [POI2009]Tab 模拟]]></title><link>https://blog.youkuaiyun.com/neighthorn/article/details/53140606</link><guid>https://blog.youkuaiyun.com/neighthorn/article/details/53140606</guid><author>neighthorn</author><pubDate>Sat, 12 Nov 2016 14:43:34 +0800</pubDate><description><![CDATA[模拟]]></description><category></category></item><item><title><![CDATA[BZOJ 1123: [POI2008]BLO tarjan求割点]]></title><link>https://blog.youkuaiyun.com/neighthorn/article/details/53138397</link><guid>https://blog.youkuaiyun.com/neighthorn/article/details/53138397</guid><author>neighthorn</author><pubDate>Sat, 12 Nov 2016 10:10:08 +0800</pubDate><description><![CDATA[tarjan]]></description><category></category></item><item><title><![CDATA[AIZU Lowest Common Ancestor Tarjan求LCA]]></title><link>https://blog.youkuaiyun.com/neighthorn/article/details/53129631</link><guid>https://blog.youkuaiyun.com/neighthorn/article/details/53129631</guid><author>neighthorn</author><pubDate>Fri, 11 Nov 2016 15:57:08 +0800</pubDate><description><![CDATA[tarjanlca]]></description><category></category></item><item><title><![CDATA[BZOJ 4385: [POI2015]Wilcze doły 单调队列]]></title><link>https://blog.youkuaiyun.com/neighthorn/article/details/53118079</link><guid>https://blog.youkuaiyun.com/neighthorn/article/details/53118079</guid><author>neighthorn</author><pubDate>Thu, 10 Nov 2016 17:37:29 +0800</pubDate><description><![CDATA[单调队列]]></description><category></category></item><item><title><![CDATA[BZOJ 4144: [AMPPZ2014]Petrol 最短路+最小生成树+倍增]]></title><link>https://blog.youkuaiyun.com/neighthorn/article/details/53102805</link><guid>https://blog.youkuaiyun.com/neighthorn/article/details/53102805</guid><author>neighthorn</author><pubDate>Wed, 09 Nov 2016 17:47:36 +0800</pubDate><description><![CDATA[最短路+最小生成树+倍增]]></description><category></category></item><item><title><![CDATA[BZOJ 1122: [POI2008]账本BBB]]></title><link>https://blog.youkuaiyun.com/neighthorn/article/details/53068853</link><guid>https://blog.youkuaiyun.com/neighthorn/article/details/53068853</guid><author>neighthorn</author><pubDate>Mon, 07 Nov 2016 18:34:30 +0800</pubDate><description><![CDATA[lalala]]></description><category></category></item><item><title><![CDATA[BZOJ 1120: [POI2009]STR]]></title><link>https://blog.youkuaiyun.com/neighthorn/article/details/53066609</link><guid>https://blog.youkuaiyun.com/neighthorn/article/details/53066609</guid><author>neighthorn</author><pubDate>Mon, 07 Nov 2016 15:23:50 +0800</pubDate><description><![CDATA[时空隧道Description平面上有z个点，给你p个形如 p1(x1,y1),p2(x2,y2) 的询问，要你求出z个点中离p1更近的点，离p2更近的点，与p1和p2的距离相等的点各有多少个。这里的距离指的是曼哈顿距离，即x坐标之差的绝对值加上y坐标之差的绝对值。Input第一行n,m,z,p。下述所有坐标均满足1<=x<=n,1<=y<=m。接下来z行，每行xi,yi表示第i个点的坐标。接下来p]]></description><category></category></item><item><title><![CDATA[BZOJ 1109: [POI2007]堆积木Klo LIS]]></title><link>https://blog.youkuaiyun.com/neighthorn/article/details/53064149</link><guid>https://blog.youkuaiyun.com/neighthorn/article/details/53064149</guid><author>neighthorn</author><pubDate>Mon, 07 Nov 2016 10:23:19 +0800</pubDate><description><![CDATA[LIS]]></description><category></category></item><item><title><![CDATA[BZOJ 1119: [POI2009]SLO 置换+贪心]]></title><link>https://blog.youkuaiyun.com/neighthorn/article/details/53049221</link><guid>https://blog.youkuaiyun.com/neighthorn/article/details/53049221</guid><author>neighthorn</author><pubDate>Sat, 05 Nov 2016 23:49:07 +0800</pubDate><description><![CDATA[置换+贪心]]></description><category></category></item><item><title><![CDATA[BZOJ 1117: [POI2009]救火站Gas 贪心]]></title><link>https://blog.youkuaiyun.com/neighthorn/article/details/53046157</link><guid>https://blog.youkuaiyun.com/neighthorn/article/details/53046157</guid><author>neighthorn</author><pubDate>Sat, 05 Nov 2016 16:36:03 +0800</pubDate><description><![CDATA[贪心]]></description><category></category></item><item><title><![CDATA[BZOJ 1116: [POI2008]CLO 并查集]]></title><link>https://blog.youkuaiyun.com/neighthorn/article/details/53044297</link><guid>https://blog.youkuaiyun.com/neighthorn/article/details/53044297</guid><author>neighthorn</author><pubDate>Sat, 05 Nov 2016 11:17:49 +0800</pubDate><description><![CDATA[并查集]]></description><category></category></item><item><title><![CDATA[BZOJ 1115: [POI2009]石子游戏Kam 阶梯Nim]]></title><link>https://blog.youkuaiyun.com/neighthorn/article/details/53039389</link><guid>https://blog.youkuaiyun.com/neighthorn/article/details/53039389</guid><author>neighthorn</author><pubDate>Fri, 04 Nov 2016 21:21:09 +0800</pubDate><description><![CDATA[阶梯Nim]]></description><category></category></item><item><title><![CDATA[BZOJ 1112: [POI2008]砖块Klo 线段树维护区间中位数]]></title><link>https://blog.youkuaiyun.com/neighthorn/article/details/53036184</link><guid>https://blog.youkuaiyun.com/neighthorn/article/details/53036184</guid><author>neighthorn</author><pubDate>Fri, 04 Nov 2016 16:09:48 +0800</pubDate><description><![CDATA[线段树]]></description><category></category></item><item><title><![CDATA[BZOJ 1110: [POI2007]砝码Odw 进制转换+贪心]]></title><link>https://blog.youkuaiyun.com/neighthorn/article/details/53032056</link><guid>https://blog.youkuaiyun.com/neighthorn/article/details/53032056</guid><author>neighthorn</author><pubDate>Fri, 04 Nov 2016 09:57:55 +0800</pubDate><description><![CDATA[进制转换+贪心]]></description><category></category></item><item><title><![CDATA[BZOJ 1111: [POI2007]四进制的天平Wag DP+高精度]]></title><link>https://blog.youkuaiyun.com/neighthorn/article/details/53027400</link><guid>https://blog.youkuaiyun.com/neighthorn/article/details/53027400</guid><author>neighthorn</author><pubDate>Thu, 03 Nov 2016 22:43:42 +0800</pubDate><description><![CDATA[1111汪汪汪]]></description><category></category></item><item><title><![CDATA[BZOJ 1104: [POI2007]洪水pow 并查集]]></title><link>https://blog.youkuaiyun.com/neighthorn/article/details/53022615</link><guid>https://blog.youkuaiyun.com/neighthorn/article/details/53022615</guid><author>neighthorn</author><pubDate>Thu, 03 Nov 2016 16:17:46 +0800</pubDate><description><![CDATA[时空隧道分析： 
首先我们可以得出水泵一定是安在城市上的… 
以上纯属瞎扯淡…只是答案相等可以…至于为什么我们待会儿再说… 
我们取出所有的城市放在s集合中，因为海拔高的可以被海拔低的覆盖，所以我们从小到大排序从所有的元素中取出海拔小于等于当前城市海拔的元素，合并相邻元素，然后查询当前城市所在的联通块是否已经被覆盖，如果没有就在当前城市安上水泵… 
回到最初的那句话…有一个数据是长这个样子的： 
然]]></description><category></category></item><item><title><![CDATA[POJ 3694 Network 割边]]></title><link>https://blog.youkuaiyun.com/neighthorn/article/details/53011186</link><guid>https://blog.youkuaiyun.com/neighthorn/article/details/53011186</guid><author>neighthorn</author><pubDate>Wed, 02 Nov 2016 19:40:04 +0800</pubDate><description><![CDATA[tarjan]]></description><category></category></item></channel></rss>