随笔分类 -  ...树~线段树&&树状数组

1 2 下一页
第十四个目标(dp + 树状数组 + 线段树)
摘要：Problem 2236 第十四个目标 Accept: 17 Submit: 35 Time Limit: 1000 mSec Memory Limit : 32768 KB Accept: 17 Submit: 35 Time Limit: 1000 mSec Memory Limit : 327 阅读全文
posted @ 2016-05-03 21:52 handsomecui 阅读(371) 评论(0) 推荐(0) 编辑
A Simple Problem with Integers（100棵树状数组）
摘要：A Simple Problem with Integers Time Limit: 5000/1500 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 5034 Accepted Sub 阅读全文
posted @ 2016-04-26 15:53 handsomecui 阅读(254) 评论(0) 推荐(0) 编辑
A Corrupt Mayor's Performance Art（线段树区间更新+位运算，颜色段种类）
摘要：A Corrupt Mayor's Performance Art Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 100000/100000 K (Java/Others) Total Submission(s): 1905 Accepte 阅读全文
posted @ 2016-04-22 21:41 handsomecui 阅读(275) 评论(0) 推荐(0) 编辑
bzoj 维护序列seq(双标记线段树)
摘要：【样例说明】初始时数列为(1,2,3,4,5,6,7)。经过第1次操作后，数列为(1,10,15,20,25,6,7)。对第2次操作，和为10+15+20=45，模43的结果是2。经过第3次操作后，数列为(1,10,24,29,34,15,16}对第4次操作，和为1+10+24=35，模43的结果是 阅读全文
posted @ 2016-03-24 12:35 handsomecui 阅读(271) 评论(0) 推荐(0) 编辑
Curious Robin Hood(树状数组+线段树)
摘要：1112 - Curious Robin Hood PDF (English) Statistics Forum Time Limit: 1 second(s) Memory Limit: 64 MB Robin Hood likes to loot rich people since he hel 阅读全文
posted @ 2016-03-02 22:05 handsomecui 阅读(332) 评论(0) 推荐(0) 编辑
LightOJ 1085(树状数组+离散化+DP，线段树)
摘要：All Possible Increasing Subsequences Time Limit:3000MS Memory Limit:65536KB 64bit IO Format:%lld & %llu Appoint description: Description An increasing 阅读全文
posted @ 2016-02-25 14:37 handsomecui 阅读(334) 评论(0) 推荐(0) 编辑
Sequence operation(线段树区间多种操作)
摘要：Sequence operation Time Limit: 10000/5000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 7452 Accepted Submission(s): 阅读全文
posted @ 2016-02-20 12:46 handsomecui 阅读(395) 评论(0) 推荐(0) 编辑
LCIS（线段树区间合并）
摘要：LCIS Time Limit: 6000/2000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 5912 Accepted Submission(s): 2563 Problem D 阅读全文
posted @ 2016-02-20 08:03 handsomecui 阅读(407) 评论(0) 推荐(0) 编辑
Hotel(线段树合并)
摘要：Hotel Time Limit: 3000MS Memory Limit: 65536K Total Submissions: 14958 Accepted: 6450 Description The cows are journeying north to Thunder Bay in Cana 阅读全文
posted @ 2016-02-19 22:47 handsomecui 阅读(310) 评论(0) 推荐(0) 编辑
Mayor's posters(离散化线段树)
摘要：Mayor's posters Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 54067 Accepted: 15713 Description The citizens of Bytetown, AB, could not s 阅读全文
posted @ 2016-02-19 19:39 handsomecui 阅读(592) 评论(0) 推荐(0) 编辑
Count the Colors(线段树，找颜色段条数)
摘要：Count the ColorsTime Limit: 2 Seconds Memory Limit: 65536 KBPainting some colored segments on a line, some previously painted segments may be covered ... 阅读全文
posted @ 2016-01-13 13:13 handsomecui 阅读(480) 评论(0) 推荐(0) 编辑
A Simple Problem with Integers(线段树，区间更新)
摘要：Description 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 阅读全文
posted @ 2016-01-12 21:22 handsomecui 阅读(1491) 评论(0) 推荐(0) 编辑
Billboard(线段树)
摘要：BillboardTime Limit: 20000/8000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 16755Accepted Submission(s): 7089 Probl... 阅读全文
posted @ 2016-01-12 20:20 handsomecui 阅读(443) 评论(0) 推荐(0) 编辑
蓝桥杯 历届试题 小朋友排队 (树状数组)
摘要：历届试题 小朋友排队 时间限制：1.0s 内存限制：256.0MB问题描述 n 个小朋友站成一排。现在要把他们按身高从低到高的顺序排列，但是每次只能交换位置相邻的两个小朋友。 每个小朋友都有一个不高兴的程度。开始的时候，所有小朋友的不高兴程度都是0。 如果某个小朋友第一次被要求交换，则他的... 阅读全文
posted @ 2016-01-11 22:22 handsomecui 阅读(435) 评论(0) 推荐(0) 编辑
ZYB's Premutation(有逆序数输出原序列，线段树)
摘要：ZYB's PremutationTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 131072/131072 K (Java/Others) Total Submission(s): 758Accepted Submission(s): 359... 阅读全文
posted @ 2015-12-12 21:38 handsomecui 阅读(413) 评论(0) 推荐(0) 编辑
Special Subsequence（离散化线段树+dp）
摘要：Special SubsequenceTime Limit: 5 Seconds Memory Limit: 32768 KBThere a sequence S with n integers , and A is a special subsequence that satisfies |Ai-... 阅读全文
posted @ 2015-12-10 22:02 handsomecui 阅读(526) 评论(0) 推荐(0) 编辑
hpu校赛--雪人的高度（离散化线段树）
摘要：大雪过后，KK决定在春秋大道的某些区间上堆雪人。现在KK遇到了一道统计雪人高度的难题，请你帮帮他吧。注：KK堆雪人前春秋大道上是没有雪人的即所有位置雪人高度为0。 给定一个整数t，表示有t(t<=5)组测试数据。每组测试数据有两个整数N(1<=N<=200000)，表示N次操作。 操作分四种: U1 阅读全文
posted @ 2015-12-05 22:31 handsomecui 阅读(236) 评论(0) 推荐(0) 编辑
Minimum Inversion Number（线段树求逆序数）
摘要：Minimum Inversion NumberTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 15517Accepted Submission(... 阅读全文
posted @ 2015-12-04 19:52 handsomecui 阅读(266) 评论(0) 推荐(0) 编辑
数据结构---线段树
摘要：线段树转载请注明出处，谢谢！http://blog.csdn.net/metalseed/article/details/8039326持续更新中···一：线段树基本概念1：概述线段树，类似区间树，是一个完全二叉树，它在各个节点保存一条线段（数组中的一段子数组），主要用于高效解决连续区间的动态查询问... 阅读全文
posted @ 2015-12-01 15:54 handsomecui 阅读(273) 评论(0) 推荐(0) 编辑
Ultra-QuickSort(归并排序+离散化树状数组)
摘要：Ultra-QuickSortTime Limit:7000MSMemory Limit:65536KTotal Submissions:50517Accepted:18534DescriptionIn this problem, you have to analyze a particular s... 阅读全文
posted @ 2015-11-28 08:55 handsomecui 阅读(660) 评论(0) 推荐(0) 编辑

1 2 下一页