树状数组
菜圾
Hi, it's your Accepted !
展开
-
树状数组
树状数组(Binary Indexed Trees)November 15, 2012作者:Hawstein出处:http://hawstein.com/posts/binary-indexed-trees.html声明:本文采用以下协议进行授权: 自由转载-非商用-非衍生-保持署名|Creative Commons BY-NC-ND 3.0 ,转载请注明作者及出处。转载 2017-08-16 16:08:52 · 253 阅读 · 0 评论 -
poj-1656-Counting Black-(树状数组)
There is a board with 100 * 100 grids as shown below. The left-top gird is denoted as (1, 1) and the right-bottom grid is (100, 100). We may apply three commands to the board: 1. WHITE x, y,原创 2017-08-25 21:12:18 · 476 阅读 · 0 评论 -
POJ 1990 MooFest (树状数组)
POJ 1990 MooFest (树状数组)Every year, Farmer John's N (1 <= N <= 20,000) cows attend "MooFest",a social gathering of cows from around the world. MooFest involves a variety of events including haybale stacking, fence jumping, pin the tail on the farmer, and o原创 2017-08-25 17:37:30 · 253 阅读 · 0 评论 -
HDU-1394-Minimum Inversion Number-(树状数组)
HDU-1394-Minimum Inversion Number-(树状数组)The inversion number of a given number sequence a1, a2, ..., an is the number of pairs (ai, aj) that satisfy i < j and ai > aj.For a given sequence of numbers a1, a2, ..., an, if we move the first m >= 0 numbers t原创 2017-08-22 23:02:12 · 299 阅读 · 0 评论 -
HDU-2688-Rotate-(树状数组)
HDU-2688-Rotate-(树状数组)Recently yifenfei face such a problem that give you millions of positive integers,tell how many pairs i and j that satisfy F[i] smaller than F[j] strictly when i is smaller than j strictly. i and j is the serial number in the interge原创 2017-08-23 19:59:37 · 244 阅读 · 0 评论 -
【转】POJ 3378 Crazy Thairs(数据集中+DP+树状数组+高精度)
转自:http://blog.csdn.net/u013480600/article/details/21407795POJ 3378 Crazy Thairs(数据集中+DP+树状数组+高精度)http://poj.org/problem?id=3378题意: 有一个N个数组成的数列,问你该数列中有多少上升5元序列,即满足如下要求的序列(不要求连续取5个转载 2017-08-24 11:47:17 · 260 阅读 · 0 评论 -
HDU-4267-A Simple Problem with Integers-(树状数组)
Problem DescriptionLet A1, A2, ... , AN be N elements. You need to deal with two kinds of operations. One type of operation is to add a given number to a few numbers in a given interval. The other原创 2017-10-05 16:54:28 · 210 阅读 · 0 评论 -
hdu-4638-Group-(树状数组,离线操作)
Problem DescriptionThere are n men ,every man has an ID(1..n).their ID is unique. Whose ID is i and i-1 are friends, Whose ID is i and i+1 are friends. These n men stand in line. Now we select an原创 2017-10-07 22:08:29 · 314 阅读 · 0 评论 -
hdu-4630-No Pain No Game-(树状数组,离线处理)
Problem DescriptionLife is a game,and you lose it,so you suicide.But you can not kill yourself before you solve this problem:Given you a sequence of number a1, a2, ..., an.They are also a perm原创 2017-10-08 19:35:31 · 274 阅读 · 0 评论 -
POJ-3416-Crossing-(树状数组)
Problem DescriptionWintokk has collected a huge amount of coins at THU. One day he had all his coins fallen on to the ground. Unfortunately, WangDong came by and decided to rob Wintokk of the原创 2017-10-06 16:00:18 · 246 阅读 · 0 评论 -
2017 ACM-ICPC 亚洲区(南宁赛区)网络赛-- B. Train Seats Reservation-(区间更新,单点查询思想)
2017 ACM-ICPC 亚洲区(南宁赛区)网络赛-- B. Train Seats ReservationYou are given a list of train stations, say from the station 11 to the station 100100.The passengers can order several tickets from one station to another before the train leaves the station one. We原创 2017-09-24 17:03:40 · 331 阅读 · 0 评论 -
牛客网暑期ACM多校训练营(第一场)- (A,D,J)
A Monotonic Matrix 题意:求满足下列条件的n*m的矩阵有多少种,①.元素属于{0,1,2};②.每行的值都递增;③.每列的值都递增。解析:如果矩阵行、列号往下往右递增,发现0左上,2在右下,考虑0和1的分界线,1和2的分界线,是 (n, 0) 到 (0,m) 的两条不相交(可重合)路径,由于从(n,0)出发只有右或上两个选择所以下一步一定在(n-1,0)或(n...原创 2018-07-20 15:28:55 · 805 阅读 · 0 评论 -
牛客网暑期ACM多校训练营(第五场)- (A,F)
比赛链接:https://www.nowcoder.com/acm/contest/143#questionA gpa 题意:给出Kanade的n门课的学分si和成绩ci,Kanade的gpa计算方法如下:,现在可以去掉最多k门课,使得去掉后的gpa最大,求该gpa。解析:典型01分数规划问题,按模板做就好,01分数规划问题:所谓的01分数规划问题就是指这样的一类问题,给定两...原创 2018-08-03 10:39:00 · 306 阅读 · 0 评论 -
牛客网暑期ACM多校训练营(第十场)- A - Rikka with Lowbit - (线段树 or 树状数组)
题目链接:https://www.nowcoder.com/acm/contest/148/A题意:有函数f(x)它的值有一半概率是x - lowbit(x),一半概率是x + lowbit(x)。现在给出数组A[]对其有两种操作:①.给[L,R]区间内Ai赋值为f(A[i]);②.查询区间[L,R]内Ai和的期望。解析:由于每个被操作的元素减和加的概率相同,所以期望值不变。直接无视操作1...原创 2018-08-19 20:23:24 · 274 阅读 · 2 评论 -
LibreOJ #144. DFS 序 1 - (DFS序+树状数组)
题目链接:https://loj.ac/problem/144题面:给一棵有根树,这棵树由编号为1…N的N个结点组成。根结点的编号为R。每个结点都有一个权值,结点i的权值为vi。接下来有M组操作,操作分为两类:1 a x,表示将结点a的权值增加x; 2 a,表示求结点a的子树上所有结点的权值之和。输入格式:第一行有三个整数 N,M和R。 第二行有 N 个整数,第 i 个整数...原创 2018-11-18 21:58:38 · 1247 阅读 · 0 评论 -
POJ 2155 Matrix(二维树状数组)
POJ 2155 Matrix(二维树状数组)Given an N*N matrix A, whose elements are either 0 or 1. A[i, j] means the number in the i-th row and j-th column. Initially we have A[i, j] = 0 (1 <= i, j <= N). We can change the matrix in the following way. Given a rectangle wh原创 2017-08-25 15:52:13 · 219 阅读 · 0 评论 -
poj-2182-Lost Cows (树状数组,线段树)
Problem DescriptionN (2 <= N <= 8,000) cows have unique brands in the range 1..N. In a spectacular display of poor judgment, they visited the neighborhood 'watering hole' and drank a few too many原创 2017-08-24 10:56:14 · 291 阅读 · 0 评论 -
poj-3067-japan--(树状数组)
DescriptionJapan plans to welcome the ACM ICPC World Finals and a lot of roads must be built for the venue. Japan is tall island with N cities on the East coast and M cities on the West coast (M <原创 2017-08-16 19:57:46 · 220 阅读 · 0 评论 -
HDU--1166--敌兵布阵--(树状数组)
敌兵布阵Problem DescriptionC国的死对头A国这段时间正在进行军事演习,所以C国间谍头子Derek和他手下Tidy又开始忙乎了。A国在海岸线沿直线布置了N个工兵营地,Derek和Tidy的任务就是要监视这些工兵营地的活动情况。由于采取了某种先进的监测手段,所以每个工兵营地的人数C国都掌握的一清二楚,每个工兵营地的人数都有可能发生变动,可能增加或减少若干人手,但这原创 2017-08-16 20:00:25 · 203 阅读 · 0 评论 -
2017年8月16日训练日记
如昨天计划,今天补了补昨天的题,感觉那些题目都是可以做的题目,可做的结果却不理想。然后今天上午老师还开了个会,讲到很重要的一个思想就是“一遍过”,这点对我来说是有些感悟的,不止ACM大学里学的东西都是如此,内容多且复杂,哪有那么多时间再学一遍?想要有一个好的掌握,就是一遍就掌握好他。如果一直反反复复,马马虎虎是浪费时间又掌握不好的。 今天剩余时间在看树状数组资料,简单说一...原创 2017-08-16 21:57:36 · 352 阅读 · 0 评论 -
poj-2352-Stars--(树状数组)
StarsTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 48752 Accepted: 21066DescriptionAstronomers often examine star maps where stars are represented b原创 2017-08-18 10:38:12 · 192 阅读 · 0 评论 -
poj-2299-Ultra-QuickSort-(树状数组and离散化)
Ultra-QuickSortTime Limit: 7000MS Memory Limit: 65536KTotal Submissions: 62846 Accepted: 23420DescriptionIn this problem, you have to analyze a particular sorti原创 2017-08-18 11:33:16 · 196 阅读 · 0 评论 -
HDU-3333-Turing Tree-(树状数组,离散化)
After inventing Turing Tree, 3xian always felt boring when solving problems about intervals, because Turing Tree could easily have the solution. As well, wily 3xian made lots of new problems about intervals. So, today, this sick thing happens again...Now原创 2017-08-18 17:06:29 · 249 阅读 · 0 评论 -
hdu-3874-Necklace-(树状数组)
Mery has a beautiful necklace. The necklace is made up of N magic balls. Each ball has a beautiful value. The balls with the same beautiful value look the same, so if two or more balls have the same beautiful value, we just count it once. We define the bea原创 2017-08-18 16:18:37 · 344 阅读 · 0 评论 -
poj-3321-Apple Tree-(树状数组)
Apple TreeTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 30537 Accepted: 9130DescriptionThere is an apple tree outside of kaka's house. Every autumn,原创 2017-08-19 10:36:03 · 397 阅读 · 0 评论 -
UVA1428 Ping pong(树状数组)
题目:https://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=4174题解:http://blog.csdn.net/u013480600/article/details/20912063这个题目是求一个数左边和右边比它小和比他大的数的个数,题解给出最简洁原创 2017-08-21 10:50:56 · 208 阅读 · 0 评论 -
基本二维树状数组
Problem DescriptionNow I am leaving hust acm. In the past two and half years, I learned so many knowledge about Algorithm and Programming, and I met so many good friends. I want to say sorry to Mr原创 2017-08-21 14:52:04 · 225 阅读 · 0 评论 -
2017年8月18日训练日记
树状数组经常会将一个数组离散化,这里说两种离散化的方法: 1.用一层循环将a数组离散化为b数组,就是将a数组从小到大依次放入b数组对应的位置for(i=1;i<=n;i++){ scanf("%d",&a[i].v); a[i].id=i; //用结构体将元素与编号保存是重要的一步}sort(a+1,a+n+1);b[a[1].id]=1;for(i=2原创 2017-08-18 20:55:19 · 226 阅读 · 0 评论 -
Find the nondecreasing subsequences--(树状数组)
Problem DescriptionHow many nondecreasing subsequences can you find in the sequence S = {s1, s2, s3, ...., sn} ? For example, we assume that S = {1, 2, 3}, and you can find seven nondecreasing sub原创 2017-08-21 18:13:37 · 293 阅读 · 0 评论 -
Flowers--(树状数组,离散化)
Problem DescriptionAs is known to all, the blooming time and duration varies between different kinds of flowers. Now there is a garden planted full of flowers. The gardener wants to know how many原创 2017-08-22 10:21:37 · 329 阅读 · 0 评论 -
Cube--(三维树状数组)
Total Submission(s) : 5 Accepted Submission(s) : 4Problem DescriptionGiven an N*N*N cube A, whose elements are either 0 or 1. A[i, j, k] means the number in the i-th row , j-th column and k-原创 2017-08-22 12:05:52 · 348 阅读 · 0 评论 -
牛客小白月赛9 - E.换个角度思考 - (树状数组离线操作 or 主席树)
题目链接:https://ac.nowcoder.com/acm/contest/275/E题意:给定一个序列a[1,n],有多次询问,每次查询给出 (l,r,x),表示查询区间a[l,r]里小于等于k的元素的个数。解析:如果题目是强制在线操作,那这就是主席树的模板题(我只会套模板)。但此题不强制在在线,那么可以用树状数组离线操作(过程见代码),解法算是比较简单,但是我一个不经常用bit的...原创 2018-11-18 15:40:04 · 202 阅读 · 0 评论