- 博客(33)
- 资源 (3)
- 收藏
- 关注
原创 BestCoder Round #53
现在博客更新比较少了,就当我还活着吧Rikka with Graph题目传送:HDU - 5422 - Rikka with GraphAC代码:#include <map>#include <set>#include <list>#include <cmath>#include <deque>#include <queue>#include <stack>#include <bits
2015-08-29 22:13:07 588
原创 深搜简单题
城堡问题题目传送:2815:城堡问题AC代码(递归形式的dfs):#include <map>#include <set>#include <cmath>#include <deque>#include <queue>#include <stack>#include <cstdio>#include <cctype>#include <string>#include <vector
2015-08-29 08:55:56 2350
原创 回文串之manacher算法
最长回文题目传送:HDU - 3068 - 最长回文AC代码:#include <map>#include <set>#include <list>#include <cmath>#include <deque>#include <queue>#include <stack>#include <bitset>#include <cctype>#include <cstdio>#i
2015-08-26 16:56:15 610
原创 点的双连通分量问题
连通性·四题目传送:hihoCoder - 1190 - 连通性·四好吧,这简单题敲了好久。。快一上午了,,基础不好诶。。AC代码:#include <map>#include <set>#include <list>#include <cmath>#include <deque>#include <queue>#include <stack>#include <bitset>#in
2015-08-25 10:36:49 1260
原创 强连通分量问题
连通性·三题目传送:hihoCoder - 1185 - 连通性·三AC代码:#include <map>#include <set>#include <list>#include <cmath>#include <deque>#include <queue>#include <stack>#include <bitset>#include <cctype>#include <cs
2015-08-24 20:58:35 696
原创 边的双连通分量问题
连通性二·边的双连通分量题目传送:hihoCoder - 1184 - 连通性二·边的双连通分量AC代码:#include <map>#include <set>#include <list>#include <cmath>#include <deque>#include <queue>#include <stack>#include <bitset>#include <cctype
2015-08-24 16:04:51 946
原创 割点与割边问题
连通性一·割边与割点题目传送:hihoCoder - 1183 - 连通性一·割边与割点AC代码:#include <map>#include <set>#include <list>#include <cmath>#include <deque>#include <queue>#include <stack>#include <bitset>#include <cctype>#i
2015-08-24 10:51:51 1440
原创 UVALive - 4255 - Guess (拓扑排序)
Guess题目传送:Guess白书例题注意拓扑排序时,,入度同时为0的前缀和需要赋值为同一个数(这个数可以随机取,因为前缀和是累加的,每一个a的数值都只和前缀和之差有关),,因为此时可以看成他们的前缀和是相等的,不存在大小关系,,而存在大小关系的都连了一条有向边。。如果此时不赋值为同一个数,,可能对于符号0不是正解,,从而产生错误的结果。。AC代码:#include <map>#include <
2015-08-23 21:59:44 746
原创 TSP问题
Hie with the Pie题目传送:POJ - 3311 - Hie with the PieAC代码:#include <map>#include <set>#include <list>#include <cmath>#include <deque>#include <queue>#include <stack>#include <bitset>#include <ccty
2015-08-23 00:22:11 1114
原创 2015 Multi-University Training Contest 8
1004、Too Simple题目传送:HDU - 5399 - Too Simple自己在纸上模拟一下,其实可以找到一个规律,也就是找-1的个数n,然后答案为(n-1)*m!(m为每一层的方案数,因为可以任意选)然后记得没有-1的时候要特判一下AC代码:#include <map>#include <set>#include <list>#include <cmath>#include <
2015-08-18 20:20:38 717 1
原创 hihoCoder - 1116 - 计算 (线段树)
计算题目传送:#1116 : 计算AC代码:#include <map>#include <set>#include <list>#include <cmath>#include <deque>#include <queue>#include <stack>#include <bitset>#include <cctype>#include <cstdio>#include <s
2015-08-17 22:38:02 1093
原创 状压DP问题
状态压缩·一题目传送:#1044 : 状态压缩·一AC代码:#include <map>#include <set>#include <list>#include <cmath>#include <deque>#include <queue>#include <stack>#include <bitset>#include <cctype>#include <cstdio>#in
2015-08-17 15:00:53 1466
原创 逆序对问题
归并排序之逆序对题目传送:#1141 : 二分·归并排序之逆序对好吧,第一次敲归并,略挫,不过爆intWA了一发AC代码:#include <map>#include <set>#include <list>#include <cmath>#include <deque>#include <queue>#include <stack>#include <bitset>#include
2015-08-17 00:23:02 1244
原创 POJ - 1679 - The Unique MST (次小生成树)
题目传送:The Unique MSTAC代码:#include <map>#include <set>#include <list>#include <cmath>#include <deque>#include <queue>#include <stack>#include <bitset>#include <cctype>#include <cstdio>#include
2015-08-15 17:07:01 656
原创 POJ - 2286 - The Rotation Game (IDA*)
IDA*算法,即迭代加深的A*算法,实际上就是迭代加深+DFS+估价函数题目传送:The Rotation GameAC代码:#include <map>#include <set>#include <list>#include <cmath>#include <deque>#include <queue>#include <stack>#include <bitset>#inclu
2015-08-14 23:15:55 644
原创 Codeforces Round #315 (Div. 2)
题目传送:Codeforces Round #315 (Div. 2)A. Music题意较难懂,不过只要推公式就好了注意到S+(q - 1) * t = q * t;只需要t等于S即可,即每次增加S秒,就需要重新听一次歌AC代码:#include <map>#include <set>#include <list>#include <cmath>#include <deque>#incl
2015-08-12 20:58:30 725
原创 bell数
Bell数Bell数的定义: 第n个Bell数表示集合元素个数为n的划分方案数,例如集合{1,2,3,…,n}。即:B[0] = 1;每一个Bell数都是第二类Stirling数的和,即: 第二类Stirling数第二类Stirling数的定义: S(n,k)表示将n个物体划分成k个非空的不可辨别的(可以理解为盒子没有编号)集合的方法数。很明显,每一个Bell数是对应的第二类Stirl
2015-08-12 20:42:48 1297
原创 概率与数学期望简单题
UVA - 11021 - Tribles题目传送:TriblesAC代码:#include <map>#include <set>#include <list>#include <cmath>#include <deque>#include <queue>#include <stack>#include <bitset>#include <cctype>#include <cst
2015-08-12 13:09:34 2543
转载 博弈题集
==================================================================================================== HDOJ1079&POJ1082&ZOJ1024 Calendar Game [找规律博弈] HDOJ1525&POJ2348 Euclid’s Game [找规律博弈] HDOJ1564 Pl
2015-08-12 00:44:27 556
原创 SG博弈简单题
ZOJ - 2083 - Win the Game题目传送:Win the Game最近正在慢慢体会博弈里面的SG函数的意义此题是最简单的SG博弈问题,只需打个表就OK了AC代码:#include <map>#include <set>#include <list>#include <cmath>#include <deque>#include <queue>#include <stac
2015-08-12 00:24:27 1744
原创 莫比乌斯反演简单题
莫比乌斯函数这里简述一下莫比乌斯函数: 若d=1 那么μ(d)=1 若d=p1p2…pr (r个不同质数,且次数都为一)μ(d)=(-1)^r 其余 μ(d)=0莫比乌斯反演的性质性质一:(莫比乌斯反演公式)f(n)=∑(d|n)μ(d)F(n/d)f(n) = \sum(d|n) {\mu(d)F(n/d)} 性质二:μ(n)是积性函数性质三:设f是算术函数,它的和函数F(n)=
2015-08-10 21:11:24 3458 3
原创 BestCoder Round #50 (div.2)
题目传送:BestCoder Round #50 (div.2)BC感觉越做越无语了1001、Distribution moneyAC代码:#include <map>#include <set>#include <list>#include <cmath>#include <deque>#include <queue>#include <stack>#include <bitset>
2015-08-08 23:16:10 623
原创 数论 - 线性筛法与积性函数
首先以求1000000以内的素数为例来探讨筛法Eratosthenes筛法(埃拉托斯特尼筛法)时间复杂度:O(N*loglogN) 空间复杂度:O(N)代码:#include <map>#include <set>#include <list>#include <cmath>#include <deque>#include <queue>#include <stack>#inclu
2015-08-07 22:01:08 1949
原创 POJ - 1195 - Mobile phones (二维线段树)
Mobile phones题目传送:Mobile phonesAC代码:/************************************************ > Auther : zzuspy > Mail : zzuspy@qq.com > Created Time : 2015/8/7 15:24:00*******
2015-08-07 17:07:37 731
原创 关于Vim
留一下配置文件(以后陆续更新):set nocompatiblesource $VIMRUNTIME/vimrc_example.vimsource $VIMRUNTIME/mswin.vimbehave mswinset diffexpr=MyDiff()function MyDiff() let opt = '-a --binary ' if &diffopt =~ 'icase
2015-08-07 14:13:18 615
原创 Codeforces Round #Pi (Div. 2)
题目传送:Codeforces Round #Pi (Div. 2)A. Lineland Mail水题。。AC代码:#include <map>#include <set>#include <cmath>#include <deque>#include <queue>#include <stack>#include <cstdio>#include <cctype>#include
2015-08-06 16:35:25 663
原创 POJ - 2186 - Popular Cows (tarjan)
Popular Cows题目传送:Popular Cows思路:tarjan算法求强连通分量AC代码:#include <map>#include <set>#include <cmath>#include <deque>#include <queue>#include <stack>#include <cstdio>#include <cctype>#include <string
2015-08-04 23:54:52 599
原创 POJ - 3660 - Cow Contest (floyd求传递闭包)
Cow Contest题目传送:Cow Contest思路:floyd求传递闭包,即用来判断每一个点是否可以到达另一个点,然后根据该点的可以到达的点的个数和可以被到达的次数之和等于n-1,来判断该点是否已经确定了排名AC代码:#include <map>#include <set>#include <cmath>#include <deque>#include <queue>#includ
2015-08-04 22:10:31 756
原创 HDU - 1269 - 迷宫城堡 (tarjan求强连通分量)
题目传送:迷宫城堡思路:就是tarjan啦,不过korasaju肯定也行啦,这里注意可能本身就不是连通图AC代码:#include <map>#include <set>#include <cmath>#include <deque>#include <queue>#include <stack>#include <cstdio>#include <cctype>#include <
2015-08-04 10:47:14 799
原创 HDU - 1429 - 胜利大逃亡(续)
胜利大逃亡(续)题目传送:HDU - 1429 - 胜利大逃亡(续)基础广搜题,注意是用位运算来判断的是否有钥匙的。少写一个字母找了好久的bug。。好久的bug。。的bug。。bug。。gAC代码:#include <map>#include <set>#include <cmath>#include <deque>#include <queue>#include <stack>#inc
2015-08-03 22:30:13 1066
原创 UVA - 10344 - 23 out of 5 (暴力)
23 out of 5题目传送:23 out of 5解法:直接暴力,记得每次dfs调用都要回溯AC代码:#include <map>#include <set>#include <cmath>#include <deque>#include <queue>#include <stack>#include <cstdio>#include <cctype>#include <stri
2015-08-03 10:57:43 581
原创 拓扑排序简单题
确定比赛名次题目传送:HDU - 1285 - 确定比赛名次思路:拓扑排序AC代码①(遍历找最小字典序):#include <map>#include <set>#include <cmath>#include <deque>#include <queue>#include <stack>#include <cstdio>#include <cctype>#include <stri
2015-08-02 11:31:09 1946
原创 UVA - 11020 - Efficient Solutions (multiset实现BST)
Efficient Solutions题目传送:Efficient SolutionsAC代码:#include <map>#include <set>#include <cmath>#include <deque>#include <queue>#include <stack>#include <cstdio>#include <cctype>#include <string>#
2015-08-01 17:04:11 740
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人