线段树
文章平均质量分 82
GKHack
这个作者很懒,什么都没留下…
展开
-
Codeforces Round #337 (Div. 2) 610D Vika and Segments(线段树)
D. Vika and Segments time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output Vika has an infinite sheet of squared原创 2015-12-29 23:20:55 · 1372 阅读 · 0 评论 -
HDOJ1166 敌兵布阵(线段树)
Input 第一行一个整数T,表示有T组数据。 每组数据第一行一个正整数N(N 接下来每行有一条命令,命令有4种形式: (1) Add i j,i和j为正整数,表示第i个营地增加j个人(j不超过30) (2)Sub i j ,i和j为正整数,表示第i个营地减少j个人(j不超过30); (3)Query i j ,i和j为正整数,i (4)End 表示结束,这条命令在每组数据最后出原创 2015-08-10 00:01:49 · 952 阅读 · 0 评论 -
UVA12532 Interval Product(线段树)
It’s normal to feel worried and tense the day before a programming contest. To relax, you went out fora drink with some friends in a nearby pub. To keep your mind sharp for the next day, you decided t原创 2015-08-13 09:36:32 · 1042 阅读 · 0 评论 -
HDOJ2795 Billboard(线段树)
Problem Description At the entrance to the university, there is a huge rectangular billboard of size h*w (h is its height and w is its width). The board is the place where all possible announcement原创 2015-08-10 00:14:14 · 103 阅读 · 0 评论 -
HDOJ1698 Just a Hook(线段树)
Problem Description In the game of DotA, Pudge’s meat hook is actually the most horrible thing for most of the heroes. The hook is made up of several consecutive metallic sticks which are of the sa原创 2015-08-10 00:25:08 · 691 阅读 · 0 评论 -
HDOJ1394 Minimum Inversion Number(线段树)
Problem Description The inversion number of a given number sequence a1, a2, ..., an is the number of pairs (ai, aj) that satisfy i aj. For a given sequence of numbers a1, a2, ..., an, if we mov原创 2015-08-10 00:20:20 · 904 阅读 · 0 评论 -
POJ3468 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 each number in a given interval. The other is原创 2015-08-10 09:03:37 · 1206 阅读 · 0 评论 -
POJ2481 Cows(线段树 & 树状数组)
Cows Time Limit: 3000MS Memory Limit: 65536K Total Submissions: 14777 Accepted: 4890 Description Farmer John's cows have discovered that the clover growing along th原创 2015-09-01 17:30:29 · 132 阅读 · 0 评论 -
HDOJ5443 The Water Problem(线段树)
题目链接:点击打开链接 长春赛区的签到题,给一个长度为n的序列,然后进行q次询问,每次询问给出两个整数l, r,然后输出序列中[l, r]中最大值。 典型的线段树题目,套个模板轻轻松松AC。 第一次和我的两个队友合作,状态不太好,只A了两题,还得好好努力啊,尤其是我! AC代码: #include "iostream" #include "cstdio"原创 2015-09-19 20:11:59 · 944 阅读 · 0 评论 -
HDOJ5475 An easy problem(暴力 & 线段树)
题目链接:点击打开链接 t组样例,每组第一行给出q, m,q次操作,为1则乘y对m取模,为2则除y对m取模,除的时候保证y在前面乘的操作中出现过。 注意数据范围,直接暴力或者线段树单点更新都可行。 比赛时又t又wa的,4个小时愣是没想出来,这就是陷进一道题的危害,要懂得舍,才会有得!有时候自己把问题想的太麻烦了,明日 加油!为我队鼓气! AC代码(暴力): #inclu原创 2015-09-27 00:33:54 · 1018 阅读 · 0 评论 -
POJ2352 Stars(线段树 & 树状数组)
Stars Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 37709 Accepted: 16423 Description Astronomers often examine star maps where stars are represented b原创 2015-08-31 17:41:49 · 957 阅读 · 0 评论 -
FZU2171 防守阵地 II(线段树)
Problem 2171 防守阵地 II Accept: 298 Submit: 1119 Time Limit: 3000 mSec Memory Limit : 32768 KB Problem Description 部队中总共有N个士兵,每个士兵有各自的能力指数Xi,在一次演练中,指挥部确定了M个需要防守的地点,指挥部将选择M个士兵依次进入指定地点进行原创 2015-12-08 16:42:34 · 1054 阅读 · 0 评论