博客园 - sbit
uuid:6cbd1ba2-f883-4c34-aed1-30dde64a3a3e;id=717627
2017-01-24T07:38:29Z
sbit
https://www.cnblogs.com/hzf-sbit/
feed.cnblogs.com
https://www.cnblogs.com/hzf-sbit/p/4439695.html
滚粗啦 - sbit
高考加油吧。。zyf兄、bakser兄、iwtwiioi兄加油哇!
2015-04-19T11:34:00Z
2015-04-19T11:34:00Z
sbit
https://www.cnblogs.com/hzf-sbit/
【摘要】高考加油吧。。zyf兄、bakser兄、iwtwiioi兄加油哇! <a href="https://www.cnblogs.com/hzf-sbit/p/4439695.html" target="_blank">阅读全文</a>
https://www.cnblogs.com/hzf-sbit/p/4403455.html
1975: [Sdoi2010]魔法猪学院 - sbit
k短路,只会写A*的飘过。。priority_queue超空间差评!
2015-04-08T11:44:00Z
2015-04-08T11:44:00Z
sbit
https://www.cnblogs.com/hzf-sbit/
【摘要】k短路,只会写A*的飘过。。priority_queue超空间差评! <a href="https://www.cnblogs.com/hzf-sbit/p/4403455.html" target="_blank">阅读全文</a>
https://www.cnblogs.com/hzf-sbit/p/4388800.html
3641:货车运输 - sbit
3641: 货车运输 Description saffah所在的国家一共有N个城市,通过N条双向道路连接,使得城市之间两两可以到达。第i条道路连接了A[i]与B[i],其长度为L[i] km。这些道路分为M个等级。第i条道路的等级为X[i]。在第j级道路上行驶,你的限速是V[j] km/h,并且每行
2015-04-02T15:21:00Z
2015-04-02T15:21:00Z
sbit
https://www.cnblogs.com/hzf-sbit/
【摘要】3641: 货车运输 Description saffah所在的国家一共有N个城市,通过N条双向道路连接,使得城市之间两两可以到达。第i条道路连接了A[i]与B[i],其长度为L[i] km。这些道路分为M个等级。第i条道路的等级为X[i]。在第j级道路上行驶,你的限速是V[j] km/h,并且每行 <a href="https://www.cnblogs.com/hzf-sbit/p/4388800.html" target="_blank">阅读全文</a>
https://www.cnblogs.com/hzf-sbit/p/4387293.html
sdoi2014-向量集-线段树-二分斜率 - sbit
注意到线段树一个节点只有满了才会被用到,那时再建ConvexHull就行了。。。#include using namespace std;namespace my_useful_tools {#define rep(_i, _k, _j) for(int _i = _k; _i #define iv...
2015-04-02T08:16:00Z
2015-04-02T08:16:00Z
sbit
https://www.cnblogs.com/hzf-sbit/
【摘要】注意到线段树一个节点只有满了才会被用到,那时再建ConvexHull就行了。。。#include using namespace std;namespace my_useful_tools {#define rep(_i, _k, _j) for(int _i = _k; _i #define iv... <a href="https://www.cnblogs.com/hzf-sbit/p/4387293.html" target="_blank">阅读全文</a>
https://www.cnblogs.com/hzf-sbit/p/4385542.html
1391: [Ceoi2008]order - sbit
有N个工作,M种机器,每种机器你可以租或者买过来. 每个工作包括若干道工序,每道工序需要某种机器来完成,你可以通过购买或租用机器来完成。 现在给出这些参数,求最大利润Input第一行给出 N,M(1using namespace std;const int INF = 0x3f3f3f3f;#def...
2015-04-01T14:16:00Z
2015-04-01T14:16:00Z
sbit
https://www.cnblogs.com/hzf-sbit/
【摘要】有N个工作,M种机器,每种机器你可以租或者买过来. 每个工作包括若干道工序,每道工序需要某种机器来完成,你可以通过购买或租用机器来完成。 现在给出这些参数,求最大利润Input第一行给出 N,M(1using namespace std;const int INF = 0x3f3f3f3f;#def... <a href="https://www.cnblogs.com/hzf-sbit/p/4385542.html" target="_blank">阅读全文</a>
https://www.cnblogs.com/hzf-sbit/p/4385378.html
1497: [NOI2006]最大获利 - sbit
新的技术正冲击着手机通讯市场,对于各大运营商来说,这既是机遇,更是挑战。THU集团旗下的CS&T通讯公司在新一代通讯技术血战的前夜,需要做太多的准备工作,仅就站址选择一项,就需要完成前期市场研究、站址勘测、最优化等项目。在前期市场调查和站址勘测之后,公司得到了一共N个可以作为通讯信号中转站的地址,而...
2015-04-01T13:21:00Z
2015-04-01T13:21:00Z
sbit
https://www.cnblogs.com/hzf-sbit/
【摘要】新的技术正冲击着手机通讯市场,对于各大运营商来说,这既是机遇,更是挑战。THU集团旗下的CS&T通讯公司在新一代通讯技术血战的前夜,需要做太多的准备工作,仅就站址选择一项,就需要完成前期市场研究、站址勘测、最优化等项目。在前期市场调查和站址勘测之后,公司得到了一共N个可以作为通讯信号中转站的地址,而... <a href="https://www.cnblogs.com/hzf-sbit/p/4385378.html" target="_blank">阅读全文</a>
https://www.cnblogs.com/hzf-sbit/p/4166591.html
BZOJ囤题计划 - sbit
决定做一些题,学习jry,开坑(其实是填坑)~~大概会刷的很慢,大家别鄙视我。。~~欢迎鄙视果然慢出翔了,还是填完吧。。现在做了:11【2338】【HNOI2011】数矩形 枚举对角线暴力水过,所有点重合随便卡【1483】【HNOI2009】梦幻布丁 启发式合并set,懒得写链表了,注意修改时如果是...
2014-12-16T02:47:00Z
2014-12-16T02:47:00Z
sbit
https://www.cnblogs.com/hzf-sbit/
【摘要】决定做一些题,学习jry,开坑(其实是填坑)~~大概会刷的很慢,大家别鄙视我。。~~欢迎鄙视果然慢出翔了,还是填完吧。。现在做了:11【2338】【HNOI2011】数矩形 枚举对角线暴力水过,所有点重合随便卡【1483】【HNOI2009】梦幻布丁 启发式合并set,懒得写链表了,注意修改时如果是... <a href="https://www.cnblogs.com/hzf-sbit/p/4166591.html" target="_blank">阅读全文</a>
https://www.cnblogs.com/hzf-sbit/p/4166412.html
2588: Count on a tree - sbit
敢问和zwt的树有何区别。。改了读入直接交。。四百个人A,三百多个PE。。于是果断贡献几发PE。。 http://ideone.com/9XCg3D
2014-12-16T01:45:00Z
2014-12-16T01:45:00Z
sbit
https://www.cnblogs.com/hzf-sbit/
【摘要】敢问和zwt的树有何区别。。改了读入直接交。。四百个人A,三百多个PE。。于是果断贡献几发PE。。 http://ideone.com/9XCg3D <a href="https://www.cnblogs.com/hzf-sbit/p/4166412.html" target="_blank">阅读全文</a>
https://www.cnblogs.com/hzf-sbit/p/4166155.html
1089: [SCOI2003]严格n元树 - sbit
好久没更新了。。于是节操掉尽python水过本来就水的题。。1 n,d=map(int, raw_input().split())2 if d==0:3 print 14 else:5 f=[1]6 for i in range(0, d+1):7 f.app...
2014-12-15T15:52:00Z
2014-12-15T15:52:00Z
sbit
https://www.cnblogs.com/hzf-sbit/
【摘要】好久没更新了。。于是节操掉尽python水过本来就水的题。。1 n,d=map(int, raw_input().split())2 if d==0:3 print 14 else:5 f=[1]6 for i in range(0, d+1):7 f.app... <a href="https://www.cnblogs.com/hzf-sbit/p/4166155.html" target="_blank">阅读全文</a>
https://www.cnblogs.com/hzf-sbit/p/4063836.html
1926: [Sdoi2010]粟粟的书架 - sbit
![http://www.lydsy.com/JudgeOnline/images/1926.jpg](http://www.lydsy.com/JudgeOnline/images/1926.jpg)大概就是分情况乱搞。。经典维护二维前缀和暴力+莫队算法垫底QAQ```#include using...
2014-10-30T14:34:00Z
2014-10-30T14:34:00Z
sbit
https://www.cnblogs.com/hzf-sbit/
【摘要】![http://www.lydsy.com/JudgeOnline/images/1926.jpg](http://www.lydsy.com/JudgeOnline/images/1926.jpg)大概就是分情况乱搞。。经典维护二维前缀和暴力+莫队算法垫底QAQ```#include using... <a href="https://www.cnblogs.com/hzf-sbit/p/4063836.html" target="_blank">阅读全文</a>
https://www.cnblogs.com/hzf-sbit/p/4056874.html
莫队算法 - sbit
机房的众神犇都在搞这个东西,本`SB`也掺和一下下吧。莫队算法可用于解决一类可离线且在得到区间$[l,r]$的答案后,能在$O(1)$或$O(\log_2{n})$得到区间$[l,r+1]$或$[l-1,r]$的答案的问题先看这样一个问题:给出n个数字,m次询问,每次询问在区间$[l_i,r_i]$...
2014-10-28T07:00:00Z
2014-10-28T07:00:00Z
sbit
https://www.cnblogs.com/hzf-sbit/
【摘要】机房的众神犇都在搞这个东西,本`SB`也掺和一下下吧。莫队算法可用于解决一类可离线且在得到区间$[l,r]$的答案后,能在$O(1)$或$O(\log_2{n})$得到区间$[l,r+1]$或$[l-1,r]$的答案的问题先看这样一个问题:给出n个数字,m次询问,每次询问在区间$[l_i,r_i]$... <a href="https://www.cnblogs.com/hzf-sbit/p/4056874.html" target="_blank">阅读全文</a>
https://www.cnblogs.com/hzf-sbit/p/4041759.html
CF293B. Distinct Paths - sbit
B. Distinct Pathstime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputYou have a rectangularn × m-cel...
2014-10-21T14:43:00Z
2014-10-21T14:43:00Z
sbit
https://www.cnblogs.com/hzf-sbit/
【摘要】B. Distinct Pathstime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputYou have a rectangularn × m-cel... <a href="https://www.cnblogs.com/hzf-sbit/p/4041759.html" target="_blank">阅读全文</a>
https://www.cnblogs.com/hzf-sbit/p/4017223.html
CF474D. Flowers - sbit
D. Flowerstime limit per test1.5 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputWe saw the little game Marmot made f...
2014-10-10T10:27:00Z
2014-10-10T10:27:00Z
sbit
https://www.cnblogs.com/hzf-sbit/
【摘要】D. Flowerstime limit per test1.5 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputWe saw the little game Marmot made f... <a href="https://www.cnblogs.com/hzf-sbit/p/4017223.html" target="_blank">阅读全文</a>
https://www.cnblogs.com/hzf-sbit/p/4014381.html
CF455D. Serega and Fun - sbit
D. Serega and Funtime limit per test4 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputSerega loves fun. However, ever...
2014-10-09T12:45:00Z
2014-10-09T12:45:00Z
sbit
https://www.cnblogs.com/hzf-sbit/
【摘要】D. Serega and Funtime limit per test4 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputSerega loves fun. However, ever... <a href="https://www.cnblogs.com/hzf-sbit/p/4014381.html" target="_blank">阅读全文</a>
https://www.cnblogs.com/hzf-sbit/p/4013474.html
CF475C. Kamal-ol-molk's Painting - sbit
C. Kamal-ol-molk's Paintingtime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputRumors say that one o...
2014-10-09T07:28:00Z
2014-10-09T07:28:00Z
sbit
https://www.cnblogs.com/hzf-sbit/
【摘要】C. Kamal-ol-molk's Paintingtime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputRumors say that one o... <a href="https://www.cnblogs.com/hzf-sbit/p/4013474.html" target="_blank">阅读全文</a>
https://www.cnblogs.com/hzf-sbit/p/4009455.html
SPOJ 8372. Triple Sums - sbit
8372. Triple SumsProblem code: TSUMYou're given a sequencesofNdistinct integers.Consider all the possible sums of three integers from the sequence at ...
2014-10-07T08:06:00Z
2014-10-07T08:06:00Z
sbit
https://www.cnblogs.com/hzf-sbit/
【摘要】8372. Triple SumsProblem code: TSUMYou're given a sequencesofNdistinct integers.Consider all the possible sums of three integers from the sequence at ... <a href="https://www.cnblogs.com/hzf-sbit/p/4009455.html" target="_blank">阅读全文</a>
https://www.cnblogs.com/hzf-sbit/p/4009340.html
1016: [JSOI2008]最小生成树计数 - sbit
orz,感觉对最小生成树的理解又加进了一步。ps:不得不说对于经典算法的探究是永无止境的,只能通过交流和增长见识来学习和体会,自己研究确实困难。让我们来深入分析一下kruskal算法。算法过程不多说,直接证明:假设算法考虑到第k条边,这时发现边的两端已经在同一个连通块里面了(称为“冲突”),为了使这...
2014-10-07T06:52:00Z
2014-10-07T06:52:00Z
sbit
https://www.cnblogs.com/hzf-sbit/
【摘要】orz,感觉对最小生成树的理解又加进了一步。ps:不得不说对于经典算法的探究是永无止境的,只能通过交流和增长见识来学习和体会,自己研究确实困难。让我们来深入分析一下kruskal算法。算法过程不多说,直接证明:假设算法考虑到第k条边,这时发现边的两端已经在同一个连通块里面了(称为“冲突”),为了使这... <a href="https://www.cnblogs.com/hzf-sbit/p/4009340.html" target="_blank">阅读全文</a>
https://www.cnblogs.com/hzf-sbit/p/4008963.html
CF286E. Ladies' Shop - sbit
E. Ladies' Shoptime limit per test8 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputA ladies' shop has recently opene...
2014-10-06T23:24:00Z
2014-10-06T23:24:00Z
sbit
https://www.cnblogs.com/hzf-sbit/
【摘要】E. Ladies' Shoptime limit per test8 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputA ladies' shop has recently opene... <a href="https://www.cnblogs.com/hzf-sbit/p/4008963.html" target="_blank">阅读全文</a>
https://www.cnblogs.com/hzf-sbit/p/3991973.html
错排问题 - sbit
科普向~最近总是看到错排,感觉很有趣的样子。。。错排问题是指:求1~n的排列P,使得 Pi≠i 的方案数。递推设f[i]表示i个数的错排方案数,称有k个数在自己位置上的错排为k不动排。对于i-1个数已经形成的错排,添加一个i之后,可以把i与前面i-1个数中的任意一个交换,使得成为错排;对于有一个数不...
2014-09-24T23:27:00Z
2014-09-24T23:27:00Z
sbit
https://www.cnblogs.com/hzf-sbit/
【摘要】科普向~最近总是看到错排,感觉很有趣的样子。。。错排问题是指:求1~n的排列P,使得 Pi≠i 的方案数。递推设f[i]表示i个数的错排方案数,称有k个数在自己位置上的错排为k不动排。对于i-1个数已经形成的错排,添加一个i之后,可以把i与前面i-1个数中的任意一个交换,使得成为错排;对于有一个数不... <a href="https://www.cnblogs.com/hzf-sbit/p/3991973.html" target="_blank">阅读全文</a>
https://www.cnblogs.com/hzf-sbit/p/3960188.html
HNOI 2014 - sbit
D1T1:画框 frame题意:给你两个n阶正整数方阵,请你求最大的\( \sum_{i = 1}^{n} A_{i, p_i}\times \sum_{i = 1}^{n} B_{i, p_i} \)其中\({p_i}\)是一个n的排列。\(n \le 70\)。如果A=B,这就是一个二分图最大完...
2014-09-09T06:13:00Z
2014-09-09T06:13:00Z
sbit
https://www.cnblogs.com/hzf-sbit/
【摘要】D1T1:画框 frame题意:给你两个n阶正整数方阵,请你求最大的\( \sum_{i = 1}^{n} A_{i, p_i}\times \sum_{i = 1}^{n} B_{i, p_i} \)其中\({p_i}\)是一个n的排列。\(n \le 70\)。如果A=B,这就是一个二分图最大完... <a href="https://www.cnblogs.com/hzf-sbit/p/3960188.html" target="_blank">阅读全文</a>