数据结构
文章平均质量分 88
WedyZhou
这个作者很懒,什么都没留下…
展开
-
2268: SB_cyh and his BST two (treap&&set)
集合(Set)是一种包含已排序对象的关联容器begin()返回指向第一个元素的迭代器clear()清除所有元素count()返回某个值元素的个数empty()如果集合为空,返回trueend()返回指向最后一个元素的迭代器原创 2016-07-27 15:46:28 · 451 阅读 · 0 评论 -
HDU 1698(线段树区间更新)
Just a HookTime Limit: 4000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 24705 Accepted Submission(s): 12322Problem DescriptionIn the game原创 2016-01-21 14:39:46 · 222 阅读 · 0 评论 -
最大m子段和HDU1024
Max Sum Plus PlusTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 22126 Accepted Submission(s): 7423Problem DescriptionNow I t原创 2016-01-18 11:04:54 · 219 阅读 · 0 评论 -
HDU 2473 Junk-Mail Filter
B - Junk-Mail FilterTime Limit:8000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64uSubmit Status Practice HDU 2473DescriptionRecognizing junk mails is a tough task.原创 2015-08-09 09:58:07 · 404 阅读 · 0 评论 -
HDU 1166 敌兵布阵 线段树
C - 敌兵布阵Time Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64uSubmit Status Practice HDU 1166DescriptionC国的死对头A国这段时间正在进行军事演习,所以C国间谍头子Derek和他手下Tidy又开始忙乎了。A国在海岸线沿直线布置了N个工兵营地,Derek和原创 2015-08-09 10:08:24 · 363 阅读 · 0 评论 -
HDU 1754 I Hate It 线段树
D - I Hate ItTime Limit:3000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64uSubmit Status Practice HDU 1754Description很多学校流行一种比较的习惯。老师们很喜欢询问,从某某到某某当中,分数最高的是多少。 这让很原创 2015-08-09 10:15:35 · 437 阅读 · 0 评论 -
HDU 2759 Billboard 线段树
BillboardTime Limit:8000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64uSubmit Status Practice HDU 2795Description在学校的入口处有一个巨大的矩形广告牌,高为h,宽为w。所有种类的广告都可以贴,比如ACM的广告啊,还有餐厅新出了哪些好吃的,等等。。 在9月1号这原创 2015-08-09 10:19:40 · 600 阅读 · 0 评论 -
The Dole Queue(UVA 133)
The Dole QueueTime Limit: 3000MS Memory Limit: Unknown 64bit IO Format: %lld & %lluSubmit StatusDescriptionIn a serious attempt to downsize (reduce) the dole原创 2015-08-24 18:25:58 · 329 阅读 · 0 评论 -
莫队算法二(树上莫队cot2,Haruna’s Breakfast)
Count on a tree IITime Limit: 1207MS Memory Limit: 1572864KB 64bit IO Format: %lld & %lluSubmit StatusDescriptionYou are given a tree with N nodes. The tree n原创 2016-08-17 17:00:00 · 421 阅读 · 0 评论 -
线段树区间合并(POJ 3667 Hotel ,HDU HDU3308 LCIS)
对于线段树的合并,需要建立左右区间的ans,和整个区间的ans。LCIS只需要更新就行,二hotel则要用到区间的更新和合并。LCIS://#define zhouV#include#include#include#include #include#include using namespace std;#define LL long long int cons原创 2016-01-25 09:56:03 · 362 阅读 · 0 评论 -
uva514(栈)
B -RailsTime Limit:3000MS Memory Limit:0KB 64bit IO Format:%lld & %lluSubmit StatusDescriptionThere is a famous railway station in PopPush City. Country there is incred原创 2016-03-14 16:49:29 · 293 阅读 · 0 评论 -
uva442
C - Matrix Chain MultiplicationTime Limit:3000MS Memory Limit:0KB 64bit IO Format:%lld & %lluSubmit Status Practice UVA 442Appoint description: System Crawler (2016-03-13)原创 2016-03-16 18:22:20 · 454 阅读 · 0 评论 -
UVA - 11732 "strcmp()" Anyone? (字典树的处理)
题目链接:http://acm.hust.edu.cn/vjudge/problem/viewProblem.action?id=284381.对于这个题我们可以用字典树来做,我们可以统计前缀相同的字母个数,对于前缀相同的单词每个字母要比较两次(包括‘\0’)。又因为要把任意两个单词相比较。所以相同字母的比较次数为2*val[i[*(val[i]-1).对于不想得的单词,由题意可得这个仅比较一原创 2016-07-16 19:44:30 · 238 阅读 · 0 评论 -
Codeforces Round #361 (Div. 2) D Friends and Subsequences
题目链接:http://codeforces.com/contest/689/problem/D题意:给定两个长度相同的数组,a和b。问你在相同的区间中amax=bmin的区间有多少个,数组的范围为200000.解法:我们可以枚举起始点,然后用二分查到amax和bmin相等的左右端点,然后进行区间累加就可以了。对于最大值最小值的查询我们可以采用线段树和RMQ来优化。线段树的查询复杂度是lo原创 2016-07-13 19:33:33 · 335 阅读 · 0 评论 -
UVALA3942(关于字典树)
题目链接:http://acm.hust.edu.cn/vjudge/problem/viewProblem.action?id=22109解法:我们写出递推方程d[i]=sum[d[i+len(x)],d[i] 表示以i开始的字符粗的分解方案数。对于这个我们以算出他的复杂度n*m,n为单词个数,m为查找的复杂度。当我们把单词存在数组遍历时,复杂度为m(4000*100)。这个会超时的。由于原创 2016-07-12 20:44:41 · 214 阅读 · 0 评论 -
关于优先队列(681C - Heap Operations)
关于优先队列,他的实质是一个堆。在头文件中。它默认的排序方式由小到大排,即大的先出对。对于这种数据容器,在c++中我们只需先定义一个 类,然后重载小于号即可。实现如下:struct num{ int x; bool operator return x>a.x;//最小值优先 }};int main(){原创 2016-06-23 13:26:16 · 471 阅读 · 0 评论 -
2015 ACM Amman Collegiate Programming Contest L .Alternating Strings II
L. Alternating Strings IIThis problem is the same as problem D but with different constraints!Bahosain has a strange habit. He writes his daily notes in binary! His little brother also has a stran原创 2016-05-05 17:50:55 · 534 阅读 · 0 评论 -
UVA 548 Tree(建树树的遍历)
H - TreeTime Limit:3000MS Memory Limit:0KB 64bit IO Format:%lld & %lluSubmit Status Practice UVA 548Appoint description: System Crawler (2016-03-20)DescriptionYou原创 2016-03-25 18:45:41 · 680 阅读 · 0 评论 -
Trees on the level(UVA122,二叉树的建立)
BackgroundTrees are fundamental in many branches of computer science. Current state-of-the art parallel computers such as Thinking Machines' CM-5 are based on fat trees. Quad- and octal-trees are原创 2016-03-22 17:30:38 · 339 阅读 · 0 评论 -
Broken Keyboard (a.k.a. Beiju Text)(Uva11988)
题目链接:http://acm.hust.edu.cn/vjudge/problem/visitOriginUrl.action?id=18693解法:用链表实现,对于数组实现链表数组的下标就是当前地址,他的值就是他所指向的地址,所以对于链表的操作为:next[i]=next[st];next[st]=i;AC代码:#include #include#include#inc原创 2016-03-18 16:55:55 · 253 阅读 · 0 评论 -
字典树(Codeforces Round #367 (Div. 2) Vasiliy's Multiset,Xor问题 )
1.题目链接:http://www.codeforces.com/problemset/problem/706/DD. Vasiliy's Multisettime limit per test4 secondsmemory limit per test256 megabytesinputstandard inputoutputs原创 2016-08-13 19:18:41 · 471 阅读 · 0 评论