<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[chen87733982的专栏]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/chen87733982</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; chen87733982]]></copyright><item><title><![CDATA[vijos 1070]]></title><link>https://blog.youkuaiyun.com/chen87733982/article/details/4464136</link><guid>https://blog.youkuaiyun.com/chen87733982/article/details/4464136</guid><author>chen87733982</author><pubDate>Wed, 19 Aug 2009 20:27:00 +0800</pubDate><description><![CDATA[ var  fa:array[1..500]of longint;    e:array[1..250000,1..3]of longint;    bo,bb:array[1..250000]of boolean;    tt:array[1..3]of longint;    ans1,ans2,te:longint;    i,j,x,y,fx,fy,n,m:longin]]></description><category></category></item><item><title><![CDATA[vijos 1009(exgcd)]]></title><link>https://blog.youkuaiyun.com/chen87733982/article/details/4464019</link><guid>https://blog.youkuaiyun.com/chen87733982/article/details/4464019</guid><author>chen87733982</author><pubDate>Wed, 19 Aug 2009 19:17:00 +0800</pubDate><description><![CDATA[var  a,b,c,d,x,y,m,n,l,x1,y1:int64; function exgcd(a,b:int64;var x,y:int64):longint;  var t:longint;   begin    if b=0 then     begin      exgcd:=a;      x:=1;y:=0;     end    else]]></description><category></category></item><item><title><![CDATA[陈启峰 Size Balanced Tree （程序）]]></title><link>https://blog.youkuaiyun.com/chen87733982/article/details/4459507</link><guid>https://blog.youkuaiyun.com/chen87733982/article/details/4459507</guid><author>chen87733982</author><pubDate>Tue, 18 Aug 2009 16:05:00 +0800</pubDate><description><![CDATA[program CQF_SBT;const maxn=2000000;var key,s,left,right,a,b:array[0..maxn] of longint;    tt,q:longint;procedure init;begin   readln(q);   for q:=1 to q do      readln(a[q],b[q]);end]]></description><category></category></item><item><title><![CDATA[陈启峰 Size Balanced Tree]]></title><link>https://blog.youkuaiyun.com/chen87733982/article/details/4459490</link><guid>https://blog.youkuaiyun.com/chen87733982/article/details/4459490</guid><author>chen87733982</author><pubDate>Tue, 18 Aug 2009 16:02:00 +0800</pubDate><description><![CDATA[今天上网搜索关于红黑树的资料时，发现一种新的平衡二叉树（SBT），据说各方面性能很好，先摘录在此，以后再细看。 Size Balanced Tree(SBT)是一种平衡二叉查找树。它的论文由中国广东中山纪念中学的陈启峰于2006年底完成，并在Winter Camp 2007中发表。由于SBT的拼写很容易找到中文谐音，它常被中国的OIer们戏称为“傻X树”、“Super BT”等。但它的性能]]></description><category></category></item><item><title><![CDATA[郁闷的出纳员（用 Size Balanced tree）；]]></title><link>https://blog.youkuaiyun.com/chen87733982/article/details/4459427</link><guid>https://blog.youkuaiyun.com/chen87733982/article/details/4459427</guid><author>chen87733982</author><pubDate>Tue, 18 Aug 2009 15:53:00 +0800</pubDate><description><![CDATA[ 郁闷的出纳员 【问题描述】OIER公司是一家大型专业化软件公司，有着数以万计的员工。作为一名出纳员，我的任务之一便是统计每位员工的工资。这本来是一份不错的工作，但是令人郁闷的是，我们的老板反复无常，经常调整员工的工资。如果他心情好，就可能把每位员工的工资加上一个相同的量。反之，如果心情不好，就可能把他们的工资扣除一个相同的量。我真不知道除了调工资他还做什么其它事情。工资的频繁]]></description><category></category></item><item><title><![CDATA[怪盗基德之最后の战 vijos1614]]></title><link>https://blog.youkuaiyun.com/chen87733982/article/details/4457923</link><guid>https://blog.youkuaiyun.com/chen87733982/article/details/4457923</guid><author>chen87733982</author><pubDate>Tue, 18 Aug 2009 10:15:00 +0800</pubDate><description><![CDATA[vijos1614 我们来考虑这样一个方阵：在左下角放上1，然后每个格子的左边即为这个格子中数的4倍，上面为5倍，则整个方阵就成为：【下面是4*4的例子】1255002000800025100400160052080]]></description><category></category></item></channel></rss>