<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[Lethelody的专栏]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/Lethelody</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; Lethelody]]></copyright><item><title><![CDATA[【BumpMap】凹凸贴图绘制简单图形]]></title><link>https://blog.youkuaiyun.com/Lethelody/article/details/71915216</link><guid>https://blog.youkuaiyun.com/Lethelody/article/details/71915216</guid><author>Lethelody</author><pubDate>Sun, 14 May 2017 01:42:47 +0800</pubDate><description><![CDATA[主要思想就是通过 (x + dx, y), (x - dx, y), (x, y + dx), (x, y - dx) 这四个点的高度计算出(x, y) 点法向量的该变量：
	if (i != XMAX)
		normal[i][j] = normal[i][j] - (position[i][j] - position[i + 1][j]).Unitization() * (height[i]]]></description><category></category></item><item><title><![CDATA[Bezier曲线绘制]]></title><link>https://blog.youkuaiyun.com/Lethelody/article/details/68939484</link><guid>https://blog.youkuaiyun.com/Lethelody/article/details/68939484</guid><author>Lethelody</author><pubDate>Sat, 01 Apr 2017 00:15:10 +0800</pubDate><description><![CDATA[#include 
#include 
#include 
#include 
#include 

using namespace std;

const int xMax = 1000, yMax = 2000, pMax = 19;
const double iDelta = 1e-5;

ifstream inFile("Sample.in");
ofstream outFile("Tes]]></description><category></category></item><item><title><![CDATA[直线段裁剪 Cohen_SutherLand 以及 Liang_Barsky 算法]]></title><link>https://blog.youkuaiyun.com/Lethelody/article/details/62889085</link><guid>https://blog.youkuaiyun.com/Lethelody/article/details/62889085</guid><author>Lethelody</author><pubDate>Fri, 17 Mar 2017 15:30:27 +0800</pubDate><description><![CDATA[#include 
#include 
#include 
#include 
#include 
#include 
#include 

using namespace std;

const int maxX = 1080, maxY = 1920, maxP = 40;
const int LineW = 4;
const int xMax = 800, xMin = 300, yMax ]]></description><category></category></item><item><title><![CDATA[扫瞄线填充算法 AND 高斯抗锯齿算法]]></title><link>https://blog.youkuaiyun.com/Lethelody/article/details/62237393</link><guid>https://blog.youkuaiyun.com/Lethelody/article/details/62237393</guid><author>Lethelody</author><pubDate>Wed, 15 Mar 2017 20:54:01 +0800</pubDate><description><![CDATA[#include 
#include 
#include 
#include 
#include 
#include 
#include 

using namespace std;

const int maxX = 1080, maxY = 1920, maxP = 100;

int num[maxX][maxY];

const double eps = 1e-6, Pi = 4 * at]]></description><category></category></item><item><title><![CDATA[【Vimrc】计算概论·专用版]]></title><link>https://blog.youkuaiyun.com/Lethelody/article/details/53942181</link><guid>https://blog.youkuaiyun.com/Lethelody/article/details/53942181</guid><author>Lethelody</author><pubDate>Fri, 30 Dec 2016 13:59:25 +0800</pubDate><description><![CDATA[set nocompatible
source $VIMRUNTIME/vimrc_example.vim
source $VIMRUNTIME/mswin.vim
behave mswin

set diffexpr=MyDiff()
function MyDiff()
  let opt = '-a --binary '
  if &diffopt =~ 'icase' | let opt =]]></description><category></category></item><item><title><![CDATA[HDOJ【5575】【单调栈】【可并堆】]]></title><link>https://blog.youkuaiyun.com/Lethelody/article/details/50166853</link><guid>https://blog.youkuaiyun.com/Lethelody/article/details/50166853</guid><author>Lethelody</author><pubDate>Thu, 03 Dec 2015 21:54:08 +0800</pubDate><description><![CDATA[好久木有做题啦！
/* I will wait for you */

#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#define fi fi]]></description><category></category></item><item><title><![CDATA[BZOJ3110【线段树】]]></title><link>https://blog.youkuaiyun.com/Lethelody/article/details/46849123</link><guid>https://blog.youkuaiyun.com/Lethelody/article/details/46849123</guid><author>Lethelody</author><pubDate>Sun, 12 Jul 2015 11:38:13 +0800</pubDate><description><![CDATA[写的是区间线段树套权值线段树.似乎比反过来写要麻烦.SAD.
为了节省内存.内层的线段树要动态开点.
/* I will wait for you */
 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include ]]></description><category></category></item><item><title><![CDATA[BZOJ1975【左偏树】]]></title><link>https://blog.youkuaiyun.com/Lethelody/article/details/46849103</link><guid>https://blog.youkuaiyun.com/Lethelody/article/details/46849103</guid><author>Lethelody</author><pubDate>Sun, 12 Jul 2015 11:35:38 +0800</pubDate><description><![CDATA[卡Priority_queue的内存简直是不忍直视.
/* I will wait for you */
 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#def]]></description><category></category></item><item><title><![CDATA[POJ2449【A*算法】【可持久化左偏树】]]></title><link>https://blog.youkuaiyun.com/Lethelody/article/details/46849075</link><guid>https://blog.youkuaiyun.com/Lethelody/article/details/46849075</guid><author>Lethelody</author><pubDate>Sun, 12 Jul 2015 11:31:28 +0800</pubDate><description><![CDATA[K短路模板题.K很小所以A*就可以过了.
/* I will wait for you */

#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#define mak]]></description><category></category></item><item><title><![CDATA[POJ3150【FFT】]]></title><link>https://blog.youkuaiyun.com/Lethelody/article/details/46835801</link><guid>https://blog.youkuaiyun.com/Lethelody/article/details/46835801</guid><author>Lethelody</author><pubDate>Fri, 10 Jul 2015 22:41:46 +0800</pubDate><description><![CDATA[转移很好用矩阵表示.然而矩阵乘法复杂度是O(n^3)的.
很容易发现转移矩阵是【循环矩阵】.而且有一个美妙的性质：【循环矩阵 * 循环矩阵 = 循环矩阵】.
所以我们计算矩阵乘法的时候可以只计算第一行.剩下的可以由第一行递推得出.
一次乘法的复杂度降到了O(n^2).这是可以接受的.
#include   
#include   
#include   
#include   
#incl]]></description><category></category></item><item><title><![CDATA[BZOJ3023【中位数】]]></title><link>https://blog.youkuaiyun.com/Lethelody/article/details/46834377</link><guid>https://blog.youkuaiyun.com/Lethelody/article/details/46834377</guid><author>Lethelody</author><pubDate>Fri, 10 Jul 2015 19:35:57 +0800</pubDate><description><![CDATA[/* I will wait for you */
  
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#define make make_pair
#define ]]></description><category></category></item><item><title><![CDATA[CodeChef PrimeDST【点分治】【FFT】]]></title><link>https://blog.youkuaiyun.com/Lethelody/article/details/46812077</link><guid>https://blog.youkuaiyun.com/Lethelody/article/details/46812077</guid><author>Lethelody</author><pubDate>Thu, 09 Jul 2015 08:57:32 +0800</pubDate><description><![CDATA[/* I will wait for you */

#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#define make(a,b) make_pair(a,b)
]]></description><category></category></item><item><title><![CDATA[BZOJ4016【最短路】【点分治】]]></title><link>https://blog.youkuaiyun.com/Lethelody/article/details/46807055</link><guid>https://blog.youkuaiyun.com/Lethelody/article/details/46807055</guid><author>Lethelody</author><pubDate>Wed, 08 Jul 2015 18:31:02 +0800</pubDate><description><![CDATA[/* I will wait for you */

#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#define make(a,b) make_pair(a,b)
]]></description><category></category></item><item><title><![CDATA[BZOJ3456【分治FFT】]]></title><link>https://blog.youkuaiyun.com/Lethelody/article/details/46794817</link><guid>https://blog.youkuaiyun.com/Lethelody/article/details/46794817</guid><author>Lethelody</author><pubDate>Tue, 07 Jul 2015 21:59:44 +0800</pubDate><description><![CDATA[然而会TLE.
/* I will wait for you */

#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#define make(a,b) make_p]]></description><category></category></item><item><title><![CDATA[BZOJ3112【单纯形】]]></title><link>https://blog.youkuaiyun.com/Lethelody/article/details/46551147</link><guid>https://blog.youkuaiyun.com/Lethelody/article/details/46551147</guid><author>Lethelody</author><pubDate>Thu, 18 Jun 2015 18:40:31 +0800</pubDate><description><![CDATA[/* I will wait for you*/

#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#define make make_pair
#define fi ]]></description><category></category></item><item><title><![CDATA[BZOJ3265【单纯形】]]></title><link>https://blog.youkuaiyun.com/Lethelody/article/details/46550825</link><guid>https://blog.youkuaiyun.com/Lethelody/article/details/46550825</guid><author>Lethelody</author><pubDate>Thu, 18 Jun 2015 17:58:40 +0800</pubDate><description><![CDATA[/* I will wait for you*/

#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#define make make_pair
#define fi ]]></description><category></category></item><item><title><![CDATA[BZOJ1052【树状数组】]]></title><link>https://blog.youkuaiyun.com/Lethelody/article/details/46471699</link><guid>https://blog.youkuaiyun.com/Lethelody/article/details/46471699</guid><author>Lethelody</author><pubDate>Fri, 12 Jun 2015 14:54:51 +0800</pubDate><description><![CDATA[/* I will wait for you*/    
    
#include     
#include     
#include     
#include     
#include     
#include     
#include     
#include     
#include     
#include     
#include     
#include    ]]></description><category></category></item><item><title><![CDATA[BZOJ3527【FFT】]]></title><link>https://blog.youkuaiyun.com/Lethelody/article/details/46458673</link><guid>https://blog.youkuaiyun.com/Lethelody/article/details/46458673</guid><author>Lethelody</author><pubDate>Thu, 11 Jun 2015 15:57:54 +0800</pubDate><description><![CDATA[/* I will wait for you*/  
  
#include   
#include   
#include   
#include   
#include   
#include   
#include   
#include   
#include   
#include   
#include   
#include   
#include   
#include   
#d]]></description><category></category></item><item><title><![CDATA[BZOJ4103【可持久化Tire】]]></title><link>https://blog.youkuaiyun.com/Lethelody/article/details/46440117</link><guid>https://blog.youkuaiyun.com/Lethelody/article/details/46440117</guid><author>Lethelody</author><pubDate>Wed, 10 Jun 2015 11:57:02 +0800</pubDate><description><![CDATA[/* I will wait for you*/  
  
#include   
#include   
#include   
#include   
#include   
#include   
#include   
#include   
#include   
#include   
#include   
#include   
#include   
#include   
#d]]></description><category></category></item><item><title><![CDATA[BZOJ4104【乱搞】]]></title><link>https://blog.youkuaiyun.com/Lethelody/article/details/46428367</link><guid>https://blog.youkuaiyun.com/Lethelody/article/details/46428367</guid><author>Lethelody</author><pubDate>Tue, 09 Jun 2015 16:28:12 +0800</pubDate><description><![CDATA[对于m是干什么的，实在是不明觉厉。
#include 
#include 
#include 

using namespace std;

typedef pair pii;

pii a[1000005];

int main()
{ 
    int n, m; scanf("%d%d", &n, &m);
    
    for (int i = 0; i <= n; i++)
   ]]></description><category></category></item></channel></rss>