![](https://img-blog.csdnimg.cn/20201014180756928.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
ACM----【线段树】
文章平均质量分 80
iviko
这个作者很懒,什么都没留下…
展开
-
POJ2352
Stars Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 31671 Accepted: 13810 Description Astronomers often examine star maps where stars are represented by points on a plane and e转载 2014-07-26 01:33:19 · 418 阅读 · 0 评论 -
POJ3264
基础 Time Limit:5000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64u Submit Status Description For the daily milking, Farmer John's N cows (1 ≤ N ≤ 50,000) always line up in the s原创 2014-07-26 19:04:13 · 556 阅读 · 0 评论 -
POJ 2828
Buy Tickets Time Limit: 4000MS Memory Limit: 65536K Total Submissions: 12734 Accepted: 6292 Description Railway tickets were difficult to buy around the Lunar New Year in China, so we must原创 2014-07-27 16:01:04 · 533 阅读 · 0 评论 -
POJ 3468 线段树+lazy标记
lazy标记 Time Limit:5000MS Memory Limit:131072KB 64bit IO Format:%I64d & %I64u Submit Status Description You have N integers, A1, A2, ... , AN. You need to deal with two kin原创 2014-07-28 13:48:04 · 772 阅读 · 0 评论 -
HDU 1754
基础 Time Limit:3000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64u Submit Status Description 很多学校流行一种比较的习惯。老师们很喜欢询问,从某某到某某当中,分数最高的是多少。 这让很多学生很反感。 不管你喜不喜欢,现在需要你做的是,就是按照老师的要求,写原创 2014-07-27 11:02:06 · 513 阅读 · 0 评论 -
HDU 1166
敌兵布阵 Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 41852 Accepted Submission(s): 17722 Problem Description C国的死对头A国这段时间正在进行军事演习,所以原创 2014-07-27 13:33:01 · 392 阅读 · 0 评论 -
LightOj 1112
Curious Robin Hood Time Limit:1000MS Memory Limit:65536KB 64bit IO Format:%lld & %llu Submit Status Practice LightOJ 1112 Description Robin Hood likes to loot rich people since he help原创 2014-07-27 21:50:57 · 931 阅读 · 0 评论 -
HDU 2795
Billboard Time Limit:8000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64u Submit Status Description At the entrance to the university, there is a huge rectangular billboard of size原创 2014-07-27 17:20:42 · 432 阅读 · 0 评论 -
线段树(带删除节点)
动态最值(minmax.Cpp/c/java) (空间限制128M) 有一个包含n个元素的数组,要求实现以下操作: DELETE k:删除位置k上的数。右边的数往左移一个位置。 QUERY i j:查询位置i~j上所有数的最小值和最大值。 【输入】(minmax.in) 输入第一行包含两个数n, m,表示原始数组的元素个数和操作的个数。第二行包括n个数,表示原始数组。以下m行,原创 2014-10-04 18:04:35 · 1993 阅读 · 0 评论