ACM-数据结构
黄金四叶草
Accepted
展开
-
HDU 1166 线段树(点更新)
敌兵布阵Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 66739 Accepted Submission(s): 28109Problem DescriptionC国的死对头A国这段时间正在进行军事演习,所以原创 2016-03-07 22:04:42 · 265 阅读 · 0 评论 -
Codeforces295A Greg and Array 数据结构+两次区间更新+点查询
Codeforces295A Greg and ArrayTime Limit:1500MS Memory Limit:262144KB 64bit IO Format:%I64d & %I64uSubmitStatusPracticeCodeForces 295ADescriptionGreg has an array a = a1,原创 2016-08-01 09:21:48 · 414 阅读 · 0 评论 -
CodeForces 438D The Child and Sequence 数据结构+点更新(赋值)+区间求和
CodeForces 438D The Child and SequenceTime Limit:4000MS Memory Limit:262144KB 64bit IO Format:%I64d & %I64uSubmitStatusPracticeCodeForces 438DDescriptionAt the children's day,原创 2016-08-01 09:32:24 · 442 阅读 · 0 评论 -
POJ 2481 Cows
POJ 2481 CowsTime Limit:3000MS Memory Limit:65536KB 64bit IO Format:%lld & %lluSubmitStatusPracticePOJ 2481DescriptionFarmer John's cows have discovered that the clover growing a原创 2016-08-01 09:39:58 · 213 阅读 · 0 评论 -
HDU 5233 Gunner II 数据结构map+vector
B - Gunner IITime Limit:1000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64uSubmitStatusDescriptionLong long ago, there was a gunner whose name is Jack. He likes to go hunti原创 2016-07-21 11:55:34 · 287 阅读 · 0 评论 -
CF620C - Pearls in a Row 数据结构map映射
C - Pearls in a RowTime Limit:2000MS Memory Limit:262144KB 64bit IO Format:%I64d & %I64uSubmitStatusDescriptionThere are n pearls in a row. Let's enumerate them with integers fro原创 2016-07-21 12:06:20 · 528 阅读 · 0 评论 -
Codeforces548D Mike and Feet 数据结构+单调栈+优先队列
D - Mike and FeetTime Limit:1000MS Memory Limit:262144KB 64bit IO Format:%I64d & %I64uSubmitStatusDescriptionMike is the president of country What-The-Fatherland. There are n b原创 2016-07-21 12:21:56 · 293 阅读 · 0 评论 -
CodeForces 253D Table with Letters - 2 减小复杂度的技巧+交替枚举
E - Table with Letters - 2Time Limit:2000MS Memory Limit:262144KB 64bit IO Format:%I64d & %I64uSubmitStatusDescriptioninput input.txt output output.txt Vasya ha原创 2016-07-21 13:27:48 · 623 阅读 · 0 评论 -
HDU 3308 LCIS 最长连续递增序列+数据结构+线段树+单点更新
HDU 3308 LCISTime Limit:2000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64uSubmitStatusDescriptionGiven n integers. You have two operations: U A B: replace the Ath原创 2016-08-05 10:01:03 · 368 阅读 · 0 评论 -
CodeForces 471D MUH and Cube Walls KMP算法+串的取差性质
CodeForces 471D MUH and Cube Walls现有一个包含 n 个整数的 a1, a2, ..., an 序列和一个包含 m 个整数的 b1, b2, ..., bm. 问你在 a 序列中有多少个不同连续子序列使得每个数同时加上某个整数(可以为负数)后和 b 序列相等?两个子串不同当且仅当起始位置不同。Input第一行包含两原创 2016-08-06 00:43:05 · 439 阅读 · 0 评论 -
湖南省赛七 RMQ with Shifts 裸的线段树
RMQ with ShiftsTime Limit:1000MS Memory Limit:65535KB 64bit IO Format:SubmitStatusPracticeNBUT 1113Appoint description:DescriptionIn the traditional RMQ (Range Minimum原创 2016-08-10 10:43:45 · 266 阅读 · 0 评论 -
CodeForces 731C Socks 并查集+map计数
SocksTime Limit:2000MS Memory Limit:262144KB 64bit IO Format:%I64d & %I64uSubmit Status Practice CodeForces 731CAppoint description: System Crawler (Nov 20, 2016 12:29:12 PM)原创 2016-11-21 09:28:13 · 437 阅读 · 0 评论 -
POJ 2777 Count Color 线段树+小技巧
Count ColorTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 44939 Accepted: 13614DescriptionChosen Problem Solving and Program design as an optional cour原创 2017-03-18 20:32:07 · 249 阅读 · 0 评论 -
HDU 2586 How far away ? LCA离线tarjan思想
How far away ?Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 15746 Accepted Submission(s): 5982Problem DescriptionThere are原创 2017-06-29 09:28:12 · 231 阅读 · 0 评论 -
POJ 1986 Distance Queries LCA离线算法tarjan
Distance QueriesTime Limit: 2000MS Memory Limit: 30000KTotal Submissions: 13792 Accepted: 4870Case Time Limit: 1000MSDescriptionFarmer John's cows refused原创 2017-06-29 10:19:04 · 285 阅读 · 0 评论 -
ZOJ 3195 Design the city LCA转RMQ在线
Design the cityTime Limit: 1 Second Memory Limit: 32768 KBCerror is the mayor of city HangZhou. As you may know, the traffic system of this city is so terrible, that there are traffic j原创 2017-06-29 17:32:36 · 376 阅读 · 0 评论 -
HDU 2874 LCA在线算法RMQ
Connections between citiesTime Limit: 10000/5000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 11256 Accepted Submission(s): 2628Problem Description原创 2017-06-30 16:47:46 · 498 阅读 · 0 评论 -
CodeForces 339D Xenia and Bit Operations 数据结构+线段树+点更新
CodeForces 339D Xenia and Bit OperationsTime Limit:2000MS Memory Limit:262144KB 64bit IO Format:%I64d & %I64uSubmitStatusDescriptionXenia the beginner programmer has a sequ原创 2016-08-01 09:07:26 · 434 阅读 · 0 评论 -
POJ 3667 Hotel 数据结构+维护区间长度+区间赋值+寻找位置
POJ 3667 HotelTime Limit:3000MS Memory Limit:65536KB 64bit IO Format:%lld & %lluSubmitStatusDescriptionThe cows are journeying north to Thunder Bay in Canada to gain cultural e原创 2016-08-03 16:14:48 · 421 阅读 · 0 评论 -
CodeForces 46D 停车场 数据结构+线段树+寻找位置+维护空位+区间赋值
CodeForces 46D 停车场Time Limit:2000MS Memory Limit:262144KB 64bit IO Format:%I64d & %I64uSubmitStatusPracticeCodeForces 46DDescription有一个长为L的停车道,坐标从0开始,车辆停放时车头朝向正方向,且距离车头f范原创 2016-08-03 15:38:49 · 471 阅读 · 0 评论 -
POJ 3468 线段树(区间更新)
A Simple Problem with IntegersTime Limit: 5000MS Memory Limit: 131072KTotal Submissions: 85553 Accepted: 26573Case Time Limit: 2000MSDescriptionYou have N i原创 2016-03-08 16:01:59 · 248 阅读 · 0 评论 -
HDU 1556 数组巧用
Color the ballTime Limit: 9000/3000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 14630 Accepted Submission(s): 7307Problem DescriptionN个气球排成一排,从左到右依原创 2016-03-10 21:19:31 · 265 阅读 · 0 评论 -
HDU 1166 树状数组(点更新)
题目来源: http://acm.hdu.edu.cn/showproblem.php?pid=1166还是敌兵布阵那一题,不过这次是用的树状数组解决的。树状数组是一个特殊的数据结构,如图。它的作用是:1,完成单点更新。2,能快速求1-x的区间的和。注意,数组里面没有存放每一个点的值,存放的只是上层节点的值(红色),当然存放上层节点的值,只是为了能快速的求出区间1-原创 2016-03-11 21:05:24 · 327 阅读 · 0 评论 -
Codeforce GCD Table STL中的multisets
GCD Tabletime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputThe GCD table G of size n × n for an array of positive inte原创 2016-03-23 20:53:32 · 250 阅读 · 0 评论 -
HDU 1710二叉树的前序和中序遍历求后序遍历(结构体+指针)
Binary Tree TraversalsTime Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 5238 Accepted Submission(s): 2417Problem DescriptionA binar原创 2016-05-14 23:59:53 · 310 阅读 · 0 评论 -
POJ 2828 Buy Tickets线段树+点更新+小技巧
Buy TicketsTime Limit: 4000MS Memory Limit: 65536KTotal Submissions: 18247 Accepted: 9057DescriptionRailway tickets were difficult to buy around the Lunar New Yea原创 2016-07-27 15:50:35 · 315 阅读 · 0 评论 -
HDU 1754 I Hate It 数据结构+单点修改+区间极值
HDU 1754 I Hate ItTime Limit:3000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64uSubmitStatusDescription很多学校流行一种比较的习惯。老师们很喜欢询问,从某某到某某当中,分数最高的是多少。这让很多学生很反感。不管你喜不喜欢,现在原创 2016-07-27 22:50:34 · 276 阅读 · 0 评论 -
HDU 1394 Minimum Inversion Number
HDU 1394 Minimum Inversion NumberTime Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64uSubmitStatusDescriptionThe inversion number of a given number sequence a1原创 2016-07-27 23:09:14 · 313 阅读 · 0 评论 -
POJ 2886 Who Gets the Most Candies? 数据结构+线段树+约瑟夫环+反素数
POJ 2886 Who Gets the Most Candies?Time Limit:5000MS Memory Limit:131072KB 64bit IO Format:%lld & %lluSubmitStatusDescriptionN children are sitting in a circle to play a game.原创 2016-07-27 23:55:41 · 296 阅读 · 0 评论 -
HDU 1698 Just a Hook 数据结构+线段树+区间修改(设值)+区间求和
HDU 1698 Just a HookTime Limit:2000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64uSubmitStatusDescriptionIn the game of DotA, Pudge’s meat hook is actually the most horribl原创 2016-07-28 00:04:46 · 376 阅读 · 0 评论 -
POJ 3468 A Simple Problem with Integers 数据结构+线段树+区间更新+区间求和
POJ 3468 A Simple Problem with IntegersTime Limit:5000MS Memory Limit:131072KB 64bit IO Format:%lld & %lluSubmitStatusDescription给出了一个序列,你需要处理如下两种询问。"C a b c"表示给[a, b]区间中原创 2016-07-28 00:11:48 · 269 阅读 · 0 评论 -
HDU 1166 敌兵布阵 数据结构+树状数组+(单点更新区间求和)
HDU 1166 敌兵布阵Time Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64uSubmitStatusDescriptionLily 特别喜欢养花,但是由于她的花特别多,所以照料这些花就变得不太容易。她把她的花依次排成一行,每盆花都有一个美观值。如果Lily把原创 2016-07-27 22:36:03 · 307 阅读 · 0 评论 -
POJ 2559 Largest Rectangle in a Histogram 单调栈
Largest Rectangle in a HistogramTime Limit:1000MS Memory Limit:65536KB 64bit IO Format:%lld & %lluSubmitStatusDescriptionA histogram is a polygon composed of a sequence of rect原创 2016-07-20 10:45:29 · 303 阅读 · 0 评论 -
HDU 4417 超级马里奥 数据结构+利用树状数组进行快速统计+多维统计转换
HDU 4417 超级马里奥Time Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64uSubmitStatusPracticeHDU 4417Description马里奥是一个举世闻名的管道工,他的跳跃能力让我们钦佩。在一条长度为n的道路上,在每个整数点i的位置都有一个高度为h原创 2016-08-03 15:01:17 · 983 阅读 · 0 评论 -
HDU 4614 花瓶与花 数据结构+求和+区间赋值+维护空位
HDU 4614 花瓶与花Time Limit:2000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64uSubmitStatusPracticeHDU 4614Description Alice有N个花瓶(标号为0~ N-1)。当她收到一些花时,她会随机的选择一个瓶子A,原创 2016-08-03 15:10:33 · 386 阅读 · 0 评论 -
CodeForces 482B 有趣的数列 数据结构+线段树+位运算的技巧
CodeForces 482B 有趣的数列Time Limit:1000MS Memory Limit:262144KB 64bit IO Format:%I64d & %I64uSubmitStatusPracticeCodeForces 482BDescription 给你一个非负整数组成的数列a [1], a[2], ...,原创 2016-08-03 15:24:33 · 352 阅读 · 0 评论 -
HDU 2966 In case of failure 基础KD树
In case of failureTime Limit: 60000/30000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2106 Accepted Submission(s): 880Problem DescriptionTo hel原创 2017-06-27 17:27:14 · 398 阅读 · 0 评论