- 博客(941)
- 资源 (8)
- 收藏
- 关注
RSS订阅
原创 换博客啦!!!! www.ckboss.cf
CSDN改版以来越来越不和胃口.虽然曾在这里写了不少题解,但现在是时候离开了.....以后的内容会更新到我的新blog里: http://www.ckboss.cf/csdn博客将做为暂时的备份博客
2015-09-09 13:25:17
1239
原创 HDOJ 4276 The Ghost Blows Light 树上分组背包
先判断从1号点能否顺利到n号点,并记录路径,和所需的时间.然后从1号点开始跑树上的分组背包,需要注意的是: 1. 原路径上的点的权值提前加出来. 2. 路径上的两个点间的边长重置为0.dp方程: 设v点为u的孩子,c为u到v的边长,dp[u][vl]dp[u][vl]表示在u点花了vl的时间,则v到u的转移为: dp[u][vl]=max(dp[u][vl],dp[u][vl−j]+dp[v
2015-09-09 22:07:01
818
原创 HDOJ 4389 X mod f(x)
数位DP .dp[位][前缀和][总和][mod]dp[位][前缀和][总和][mod]然后枚举总和1~81X mod f(x)Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 2426 Accepted Submission(s):
2015-09-09 09:23:04
1016
原创 HDOJ 4267 A Simple Problem with Integers 树状数组
建10*10个树状数组,tree[x][y]tree[x][y]表示从x开始等差为y的树状数组.对于每个询问a,统计与a相关的的数组数组的和.A Simple Problem with IntegersTime Limit: 5000/1500 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submissio
2015-09-08 19:15:06
772
原创 HDOJ 4277 USACO ORZ 搜索+剪枝
暴力搜索+轻微剪枝 固定第一个数的话可以减少2/3的时间…..USACO ORZTime Limit: 5000/1500 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 4018 Accepted Submission(s): 1340Problem Descriptio
2015-09-07 22:40:40
731
原创 HDOJ 4268 Alice and Bob 贪心
按x和y排序后,贪心从y大的覆盖 用mulitset维护下即可….Alice and BobTime Limit: 10000/5000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 3817 Accepted Submission(s): 1198Problem Des
2015-09-07 21:12:32
611
原创 HDOJ 4274 Spy's Work DFS
DFS维护每个节点可以表示的范围….Spy’s WorkTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 1382 Accepted Submission(s): 438Problem Description I’m a manag
2015-09-07 21:05:06
510
原创 HDOJ 4359 Easy Tree DP? DP
Easy Tree DP?Time Limit: 10000/5000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 1482 Accepted Submission(s): 565Problem DescriptionA Bear tree
2015-09-04 18:58:20
476
原创 HDOJ 4501 小明系列故事——买年货 DP
普通DP小明系列故事——买年货Time Limit: 5000/2000 MS (Java/Others) Memory Limit: 65535/32768 K (Java/Others)Total Submission(s): 2872 Accepted Submission(s): 1280Problem Description 春节
2015-09-04 09:34:52
551
原创 HDOJ 4466 Triangle 递推
1、当b=c时，a至少为1，所以c而ac>=n/3; 故共有(n-1)/2-(n/3)+(n/3?0:1)种。2、当b此时若a+b>c 则a+b>c-1 如果a,b,c能构成三角形，则a,b,c-1也一定能够构成三角形。反过来，如果a,b,c-1能够构成三角形，也即a+b>c-1 当a+b！=c时，一定能使a,b,c构成三角形。故可以通过dp[n-1]递推过
2015-09-03 21:40:14
637
原创 HDOJ 5424 Rikka with Graph II 暴力dfs
哈密顿路径本来是NPC的问题,不过这题可以特判后直接暴力dfsRikka with Graph IITime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 1066 Accepted Submission(s): 271
2015-09-03 08:48:59
777
原创 HDOJ 4468 Spy KMP
从第一个字符开始,如果s可以与t匹配就匹配,不能匹配就加上一段SpyTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 546 Accepted Submission(s): 267Proble
2015-09-02 21:37:26
669
原创 HDOJ 4473 Exam 暴力枚举
所求的既 a*b*c暴力枚举a,b根据c计算结果ExamTime Limit: 20000/10000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1316 Accepted Submission(s): 559Problem
2015-09-02 13:57:07
700
原创 HDOJ 4467 Graph 重轻点分块
重/轻点分块重点: 与该点相关的边大于 sqrt(m)轻点: 其他的点如果不分块该怎么做:用一个ans[3]的数组记录三种情况的答案,对每个询问O(1)直接输出.对每个点用一个sum[2]的数组记录,和这个点相关的对面是0的边的权值,和对面是1的边的权值.对于x的change操作:先更新答案ans:ans[color[x]+0]-sum[0] &
2015-09-02 12:39:36
727
原创 HDOJ 4456 Crowd 离散化+二维树状数组
将坐标旋转45度就可以得到正方形,可以用二维树状数组求解...为了节省内存,提前将树状数组中会被更新的点全都存下来,并离散化CrowdTime Limit: 5000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1199 Accep
2015-08-31 21:43:16
1307
原创 HDOJ 4454 Stealing a Cake 计算几何
暴力枚举角度.....Stealing a CakeTime Limit: 5000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2495 Accepted Submission(s): 681Problem Descripti
2015-08-30 23:53:35
1077
原创 HDOJ 4453 Looploop Splay
裸的Splay模版题,维护线段的区间加,区间翻转,插入和删除.....LooploopTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1458 Accepted Submission(s): 454
2015-08-27 17:59:49
1124
原创 HDOJ 5343 MZL's Circle Zhou 后缀自动机
对第二个串建SAM求出第二个串的以每个字符开头的不同子串的数目..再对第一个串建SAM,遍历自动机如果某个节点后面没有某个字符则答案加上这个节点的出现次数乘上以这个字符为开头的在第二个串中的不同子串的数目..MZL's Circle ZhouTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 131072/131072
2015-08-26 21:57:21
1117
原创 ZOJ 3891 K-hash 后缀自动机
后缀自动机求不同的串,然后DP.....K-hashTime Limit: 2 Seconds Memory Limit: 131072 KBK-hash is a simple string hash function. It encodes a string Sconsist of digit characters into a K-dimension
2015-08-26 11:13:54
1380
原创 ZOJ 3885 The Exchange of Items 最小费用最大流
裸的最小费用最大流....The Exchange of ItemsTime Limit: 2 Seconds Memory Limit: 65536 KBBob lives in an ancient village, where transactions are done by one item exchange with another. Bob
2015-08-24 20:35:32
1166
原创 ZOJ 3883 Scan Code 模拟
模拟,考虑shift 和 caps 的各种组合Scan CodeTime Limit: 2 Seconds Memory Limit: 65536 KBEdward is writing an editor. After he wrote the function to get input from his special keyboard, he f
2015-08-24 20:32:23
1060
原创 HDOJ 5421 Victor and String 回文串自动机
如果没有操作1,就是裸的回文串自动机......可以从头部插入字符的回文串自动机,维护两个last点就好了.....当整个串都是回文串的时候把两个last统一一下Victor and StringTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 524288/262144 K (Java/Others)
2015-08-24 20:16:58
857
原创 HDOJ 5419 Victor and Toys 树状数组
分母是一定的C(m,3) 树状数组求每个数可以在那些段中出现,若x出现在了s段中,分子加上w[x]*C(s,3)Victor and ToysTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 262144/131072 K (Java/Others)Total Submission(s): 331 Accept
2015-08-23 15:53:23
733
原创 HDOJ 5418 Victor and World 状压DP
水状压DPVictor and WorldTime Limit: 4000/2000 MS (Java/Others) Memory Limit: 262144/131072 K (Java/Others)Total Submission(s): 407 Accepted Submission(s): 164Problem Description
2015-08-23 14:22:41
769
原创 HDOJ 5417 Victor and Machine 水
Victor and MachineTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 131072/65536 K (Java/Others)Total Submission(s): 240 Accepted Submission(s): 134Problem DescriptionVictor h
2015-08-23 10:29:27
967
原创 HDOJ 5409 CRB and Graph 无向图缩块
无向图缩块后,以n所在的块为根节点,dp找每块中的最大值.对于每个桥的答案为两块中的较小的最大值和较小的最大值加1CRB and GraphTime Limit: 8000/4000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 113 Accepte
2015-08-22 21:49:13
979
原创 HDOJ 5406 CRB and Apple 树状数组优化DP
dp[i][j]表示一个人吃了第i个另一个人吃了第j个时最多可以吃多少个苹果.dp[i][j]=max(max(dp[i][k]),max(dp[k][j]))+1可以用树状数组快速的求出dp[i]的某一段的最大值CRB and AppleTime Limit: 12000/6000 MS (Java/Others) Memory Limit: 655
2015-08-22 10:16:00
1180
原创 HDOJ 5416 CRB and Tree DFS
CRB and TreeTime Limit: 8000/4000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 690 Accepted Submission(s): 221Problem DescriptionCRB has a tree,
2015-08-21 16:30:01
1086
原创 HDOJ 5410 CRB and His Birthday DP背包
先跑一遍01背包,再跑一遍多重背包CRB and His BirthdayTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 327 Accepted Submission(s): 177Pro
2015-08-21 14:09:03
715
原创 HDOJ 5414 CRB and String 模拟
CRB and StringTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 491 Accepted Submission(s): 186Problem DescriptionCRB has two s
2015-08-21 11:28:52
1057
原创 HDOJ 5411 CRB and Puzzle 矩阵快速幂
直接构造矩阵,最上面一行加一排1.快速幂计算矩阵的m次方,统计第一行的和CRB and PuzzleTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 133 Accepted Submission(s): 63
2015-08-20 23:41:54
709
原创 HDOJ 5396 Expression DP
记dp_{l,r}dpl,r表示l,rl,r这段数能形成的答案总和。枚举最后一步操作kk，如果是乘法，答案为dp_{l,k}*dp_{k+1,r}dpl,k∗dpk+1,r，由于分配率这个会乘开来。如果是加法那么是dp_{l,r}*(r-k-1)!+dp_{k+1,r}*(k-l)!dpl,r∗(r−k−1)!+dpk+1,r∗(k−l)!，即要乘上右边k+1
2015-08-20 00:04:23
951
原创 HDOJ 5402 Travelling Salesman Problem 模拟
行数或列数为奇数就可以全部走完.行数和列数都是偶数,可以选择空出一个(x+y)为奇数的点.如果要空出一个(x+y)为偶数的点,则必须空出其他(x+y)为奇数的点Travelling Salesman ProblemTime Limit: 3000/1500 MS (Java/Others) Memory Limit: 65536/65536 K (Java
2015-08-19 17:39:15
774
原创 HDOJ 5399 Too Simple
每一个函数都必须是一个排列,经过连续的一段确定函数后数字不能少.满足上面的条件的话,只要有一个-1函数特别的排列一下就可以满足要求,剩下的可以随意填没有-1的话特判Too SimpleTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total S
2015-08-19 13:35:59
718
原创 HDOJ 5400 Arithmetic Sequence 暴力枚举
Arithmetic SequenceTime Limit: 4000/2000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 382 Accepted Submission(s): 196Problem DescriptionA sequen
2015-08-19 00:21:55
911
原创 HDOJ 4455 Substrings 递推+树状数组
pre[i]第i位数往前走多少位碰到和它相同的数dp[i]表示长度为i的子串,dp[i]可以由dp[i-1]加上从i到n的pre[i]>i-1的数减去最后一段长度为i-1的断中的不同的数得到....爆int+有点卡内存....SubstringsTime Limit: 10000/5000 MS (Java/Others) Memory Limit: 3276
2015-08-18 22:33:44
888
原创 HDOJ 4463 Outlets 最小生成树
Prim....似乎没有考虑多点共线也能A.....OutletsTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2565 Accepted Submission(s): 1182Problem D
2015-08-17 21:57:36
701
原创 HDOJ 4460 Friend Chains 图的最长路
类似于树的直径,从任意一个点出发,找到距离该点最远的且度数最少的点.然后再做一次最短路Friend ChainsTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 4227 Accepted Submission(
2015-08-17 17:25:24
886
原创 HDOJ 5392 Infoplane in Tina Town LCM
找循环节,分解质因数,求LCMInfoplane in Tina TownTime Limit: 14000/7000 MS (Java/Others) Memory Limit: 524288/524288 K (Java/Others)Total Submission(s): 1627 Accepted Submission(s): 380Pro
2015-08-17 16:30:43
767
原创 HDOJ 5383 Yu-Gi-Oh! 最大费用最大流
网络流裸题:分两部分建图,求不要求满流的最大费用最大流.....Yu-Gi-Oh!Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 401 Accepted Submission(s): 108P
2015-08-17 14:50:19
760
ManicTime Professional v2.5.2.1 简体中文破解版
2014-05-01
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人