摘要：
自动平衡二叉树，可以保证每次增加，输出，查询只用log(N)的时间复杂度 模板 阅读全文
摘要：
Zhenya moved from his parents’ home to study in other city. He didn’t take any cash with him, he only took his father’s credit card with zero balance 阅读全文
摘要：
Lara Croft, the fiercely independent daughter of a missing adventurer, must push herself beyond her limits when she discovers the island where her fat 阅读全文
摘要：
BaoBao and DreamGrid are playing a game using a strange button. This button is attached to an LED light (the light is initially off), a counter and a 阅读全文
摘要：
BaoBao has a sequence a1,a2,...,an. He would like to find a subset S of {1,2,...,n} such that ∀i,j∈S, ai ⊕aj include include include include inc 阅读全文
摘要：
"来源hdu17544" 很多学校流行一种比较的习惯。老师们很喜欢询问，从某某到某某当中，分数最高的是多少。 这让很多学生很反感。 不管你喜不喜欢，现在需要你做的是，就是按照老师的要求，写一个程序，模拟老师的询问。当然，老师有时候需要更新某位同学的成绩。 Input 本题目包含多组测试，请处理到文件 阅读全文
摘要：
"来源hdu1166" C国的死对头A国这段时间正在进行军事演习，所以C国间谍头子Derek和他手下Tidy又开始忙乎了。A国在海岸线沿直线布置了N个工兵营地,Derek和Tidy的任务就是要监视这些工兵营地的活动情况。由于采取了某种先进的监测手段，所以每个工兵营地的人数C国都掌握的一清二楚,每个工 阅读全文
摘要：
"来源poj3468" You have N integers, A1, A2, ... , AN. You need to deal with two kinds of operations. One type of operation is to add some given number to 阅读全文
摘要：
一般先建立结构体，要开4倍,还有a数组，存一开始的数据 struct tree { int l,r,ans; }tr[N 1; built_tree(x,mid,i 1; if(q=x&&tr[i].r 1; if(x mid) return query_tree(x,y,i 1; build_tr 阅读全文
摘要：
素数区间 include include include include include include include include include include define sf scanf define pf printf define scf(x) scanf("%d",&x) def 阅读全文