- 博客(30)
- 资源 (20)
- 收藏
- 关注
RSS订阅原创 hdu 5212 code 容斥~或者莫比乌斯
CodeTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 489 Accepted Submission(s): 191Problem DescriptionWLD likes playing with
2015-07-31 20:18:15
645
原创 hdu 1695 GCD 莫比乌斯反演
GCDTime Limit: 6000/3000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 7229 Accepted Submission(s): 2651Problem DescriptionGiven 5 integers: a, b
2015-07-31 19:34:21
829
原创 hdu 4746 Mophues 莫比乌斯反演
MophuesTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 327670/327670 K (Java/Others)Total Submission(s): 910 Accepted Submission(s): 345Problem DescriptionAs we know, any po
2015-07-31 16:39:46
805
原创 hdu 5327 Olympiad 简单题 2015多校联合训练赛
OlympiadTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 137 Accepted Submission(s): 97Problem DescriptionYou are one of the c
2015-07-30 19:47:24
1309
原创 hdu 5338 ZZX and Permutations 2015多校联合训练赛，贪心，线段树，树状数组
ZZX and PermutationsTime Limit: 6000/3000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 141 Accepted Submission(s): 24Problem DescriptionZZX li
2015-07-30 19:29:35
788
原创 hdu 5335 Walk Out 搜索+贪心
Walk OutTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 141 Accepted Submission(s): 17Problem DescriptionIn an n∗m maze, th
2015-07-30 17:55:26
1558
2
原创 hdu 5417 RGCDQ 2015多校联合训练赛
RGCDQTime Limit: 6000/3000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 1283 Accepted Submission(s): 562Problem DescriptionMr. Hdu is interested
2015-07-29 16:32:07
645
原创 hdu 5326 work 搜索 2015多校联合训练赛
WorkTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 557 Accepted Submission(s): 376Problem DescriptionIt’s an interesti
2015-07-29 16:29:32
676
原创 hdu 5324 Boring Class 2015多校联合训练赛3 分治，最长不降子序列，最小字典序
Boring ClassTime Limit: 6000/3000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 354 Accepted Submission(s): 75Problem DescriptionMr. Zstu and Mr.
2015-07-29 16:23:46
1282
原创 hdu 1402 A * B Problem Plus 快速傅里叶变换
A * B Problem PlusTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 14598 Accepted Submission(s): 2741Problem DescriptionCalcul
2015-07-26 13:32:41
802
原创 hdu 3957 Street Fighter 重复覆盖于+精确覆盖 DancingLink
Street FighterTime Limit: 20000/10000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1257 Accepted Submission(s): 472Problem DescriptionStreet Fig
2015-07-26 13:03:32
716
1
原创 hdu 3954 Level up 线段树
Level upTime Limit: 10000/3000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3674 Accepted Submission(s): 994Problem DescriptionLevel up is the t
2015-07-25 19:28:51
562
原创 hdu 5307 He is Flying 2015 Multi-University Training Contest 2 快速傅里叶变换
He is FlyingTime Limit: 10000/5000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 91 Accepted Submission(s): 25Problem DescriptionJRY wants to dra
2015-07-24 20:50:26
1716
3
原创 hdu 3511 Prison Break 圆 扫描线
Prison BreakTime Limit: 10000/5000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 1850 Accepted Submission(s): 563Problem DescriptionTo save Sara,
2015-07-24 15:10:18
1297
原创 hdu 5303 Delicious Apples 2015多校联合训练赛2 dp+枚举
Delicious ApplesTime Limit: 5000/3000 MS (Java/Others) Memory Limit: 524288/524288 K (Java/Others)Total Submission(s): 311 Accepted Submission(s): 92Problem DescriptionThere are
2015-07-24 10:16:33
630
原创 2015多校联合训练赛 hdu 5305 Friends 2015 Multi-University Training Contest 2 枚举+剪枝
FriendsTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 249 Accepted Submission(s): 103Problem DescriptionThere are n people
2015-07-23 20:41:41
864
原创 2015多校联合训练赛 hdu 5308 I Wanna Become A 24-Point Master 2015 Multi-University Training Contest 2 构造题
I Wanna Become A 24-Point MasterTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 60 Accepted Submission(s): 16Special JudgeProblem
2015-07-23 19:10:58
1129
2
原创 2015多校联合训练赛hdu 5301 Buildings 2015 Multi-University Training Contest 2 简单题
BuildingsTime Limit: 4000/2000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 185 Accepted Submission(s): 25Problem DescriptionYour current task
2015-07-23 18:32:53
1355
原创 hdu 5291 Candy Distribution 2015 Multi-University Training Contest 1 树形dp，
Candy DistributionTime Limit: 4000/2000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 217 Accepted Submission(s): 73Problem DescriptionWY has n k
2015-07-23 11:59:30
1103
1
原创 hdu 5299 Circles Game 2015 Multi-University Training Contest 1 计算几何+博弈SG函数 圆的扫描线
Circles GameTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 251 Accepted Submission(s): 51Problem DescriptionThere are n circ
2015-07-22 12:01:38
1117
3
原创 hdu 5291 Candy Distribution 2015 Multi-University Training Contest 1
Candy DistributionTime Limit: 4000/2000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 37 Accepted Submission(s): 7Problem DescriptionWY has n kin
2015-07-22 09:33:59
1905
1
原创 hdu 5289 Assignment 2015 Multi-University Training Contest 1
AssignmentTime Limit: 4000/2000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 86 Accepted Submission(s): 43Problem DescriptionTom owns a company
2015-07-21 18:38:44
935
原创 hdu 5288 OO’s Sequence 2015 Multi-University Training Contest 1
OO’s SequenceTime Limit: 4000/2000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 83 Accepted Submission(s): 34Problem DescriptionOO has got a a
2015-07-21 18:34:15
689
原创 hdu 5294 Tricks Device 2015 Multi-University Training Contest 1
题目：给一个图，起点1，终点n必须走最短路才能从起点到终点。问至少删除几条边使得无法从起点到终点。且删除最多几条边，还可以从起点到终点。分析：做最短路，所有满足dist[u] = dist[v] + w(v,u)的边都是最短路的边，对这样的边，重新建图。新图加入e(u,v)，边权为1t到s作最短路d，就是最少需要的边数能够到达边数，总边数-d就是最多能删除的边对
2015-07-21 18:26:02
1244
原创 hdu 5282 Senior's String动态规划
题目：x,y两个串，求x有多少个子序列在y的子序列中出现，且x的子序列满足长度为x和y最长子序列的长度用dp[i][j]表示x的i位置和y的j位置的最长公共子序列长度。求出dp[i][j]然后num[i][j]表示x的前i个字符构成的长度为dp[i][j]的子序列中，有多少个出现在y前j个字符构成的长度为dp[i][j]的子序列里。如果dp[i][j] == dp[i-1][1
2015-07-21 10:38:59
646
原创 HDU 2665 Kth number 主席树，函数式线段树
求区间第k大树。通常用划分树模板就可以做了。而且空间也挺小的。主席树也是可以的。主席树是什么呢？看一下别人的博客http://seter.is-programmer.com/posts/31907.html主席树是这样的。1. 平时在建立线段树的时候是建一棵完整的线段树。然后在这个线段树中进行操作。2.但是在修改线段树的时候---单点修改。 可知，需要修改的
2015-07-20 20:24:06
1591
原创 zoj 3329 One Person Game 动态规划，迭代法，二分
题意：给三个骰子，骰子有k1,k2,k3个面。每次掷骰子，得到的点数和为前进的步数，如果掷骰子的结果为c1,c2,c3（有序）则回到原点。从0点出发，到达大于N的点，则游戏结束。求掷骰子次数的期望。转移方程为： dp[i] = dp[i+l1+l2+l3]*(1/k1/k2/k3)+dp[0]*(1/k1/k2/k3)+1其中枚举l1,l2,l3为掷骰子得
2015-07-20 18:03:15
809
原创 ZOJ 3765 Lights (SPLAY)
splay。只为了贴代码保存，没用其他作用。#include#include#include#includeusing namespace std;#define maxn 500007#define inf 1000000000struct Node{ Node *fa,*ch[2]; int val,gcd[2],size,statu;};Nod
2015-07-17 20:34:27
566
转载 无向图全局最小边割集
转自 http://www.cppblog.com/imky/articles/123427.html 一个无向连通网络，去掉一个边集可以使其变成两个连通分量则这个边集就是割集；最小割集当然就权和最小的割集。可以用最小切割最大流定理：1.min=MAXINT,确定一个源点2.枚举汇点3.计算最大流，并确定当前源汇的最小割集，若比min小更新min4.转到2直
2015-07-17 08:42:43
4079
转载 曼哈顿距离最小生成树与莫队算法
一、曼哈顿距离最小生成树曼哈顿距离最小生成树问题可以简述如下：给定二维平面上的N个点，在两点之间连边的代价为其曼哈顿距离，求使所有点连通的最小代价。朴素的算法可以用O(N2)的Prim，或者处理出所有边做Kruskal，但在这里总边数有O(N2)条，所以Kruskal的复杂度变成了O(N2logN)。但是事实上，真正有用的边远没有O(N2)条。我们考虑每个点会和其他
2015-07-16 09:00:50
632
中国县级和以下行政区编码2013年版本
2016-03-29
编译技术工具
2014-05-16
数据库系统基础教程课后习题答案
2013-12-16
javaform小程序
2013-03-31
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人