
数据结构
文章平均质量分 83
___fouzhe
这个作者很懒,什么都没留下…
展开
-
HDU4699Editor
题目描述: Sample Input 8 I 2 I -1 I 1 Q 3 L D R Q 2Sample Output 2 3 HintThe following diagram shows the status of sequence after each instruction: 题意: 对一个数列进行操作,I:光标位置后面插入一个权值为x的数,D:删除光标前原创 2016-06-07 23:36:25 · 1002 阅读 · 0 评论 -
poj2796Feel Good(单调栈)
Feel Good Time Limit: 3000MS Memory Limit: 65536K Total Submissions: 13572 Accepted: 3796 Case Time Limit: 1000MS Special Judge Description Bill is developin原创 2016-12-06 16:23:02 · 529 阅读 · 0 评论 -
Codeforces Round #367 (Div. 2) E. Working routine(十字链表)
题目链接 E. Working routine time limit per test 2.5 seconds memory limit per test 256 megabytes input standard input output standard output Vasiliy finally got to work, w原创 2017-02-15 19:12:00 · 280 阅读 · 0 评论 -
gym101138J(树链剖分,线段树维护区间连续子段最大和,好题)
题目链接 J. Valentina and the Gift Tree time limit per test 6 seconds memory limit per test 256 megabytes input standard input output standard output The Valentina's birt原创 2017-02-13 12:31:09 · 373 阅读 · 0 评论 -
kd-tree学习&&hdu2966&&bzoj2648
先推荐一篇很好的博客:http://blog.youkuaiyun.com/jiangshibiao/article/details/34144829 以下是博客文章节选: ***********************************************************************************************************原创 2017-02-11 17:19:30 · 455 阅读 · 0 评论 -
codeforces 589 G. Hiring(线段树,好题)
G. Hiring time limit per test 4 seconds memory limit per test 512 megabytes input standard input output standard output The head of human resources department decided to原创 2016-11-18 17:07:46 · 338 阅读 · 0 评论 -
Codeforces Round #378 (Div. 2) D. Kostya the Sculptor(STL运用)
D. Kostya the Sculptor time limit per test 3 seconds memory limit per test 256 megabytes input standard input output standard output Kostya is a genial sculptor, he has原创 2016-11-01 18:13:02 · 429 阅读 · 0 评论 -
hdu 4302 Holedox Eating(优先队列模拟或线段树)
题目链接 Holedox Eating Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 3985 Accepted Submission(s): 1361 Problem Description H原创 2016-10-04 21:09:10 · 534 阅读 · 0 评论 -
poj 3321 Apple Tree(树状数组)
Apple Tree Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 26346 Accepted: 7820 Description There is an apple tree outside of kaka's house. Every autumn, a原创 2016-08-07 12:32:29 · 268 阅读 · 0 评论 -
poj2503Babelfish
题目描述: DescriptionYou have just moved from Waterloo to a big city. The people here speak an incomprehensible dialect of a foreign language. Fortunately, you have a dictionary to help you understand the原创 2016-06-09 00:02:51 · 432 阅读 · 0 评论 -
51nod1215数组的宽度(单调栈)
1215 数组的宽度 题目来源: Javaman 基准时间限制:1 秒 空间限制:131072 KB 分值: 80 难度:5级算法题 收藏 取消关注 N个整数组成的数组,定义子数组a[i]..a[j]的宽度为:max(a[i]..a[j]) - min(a[i]..a[j]),求所有子数组的宽度和。 Input原创 2016-12-06 17:30:52 · 719 阅读 · 0 评论