树状数组
黑码
这个作者很懒,什么都没留下…
展开
-
codeforces627 div3 D Pair of Topics(树状数组+离散化)
D. Pair of Topicstime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputThe next lecture in a high school requires two topics to be dis...原创 2020-03-12 23:31:36 · 438 阅读 · 0 评论 -
之江学院 2017 J qwb又偷懒了 树状数组
用%lld 参赛请加qq群160384471获取最新消息 Problem J: qwb又偷懒了 Time Limit: 1 Sec Memory Limit: 128 MB Submit: 517 Solved: 70 [Submit][Status][Web Board] Description qwb最近在做一个群众收入统计。ta非常懒,以至于忘记了今天领导要来视察。所以急忙催下原创 2017-06-02 10:08:52 · 518 阅读 · 0 评论 -
codeforces 61E 树状数组 逆向
The Romans have attacked again. This time they are much more than the Persians but Shapur is ready to defeat them. He says: “A lion is never afraid of a hundred sheep”.Nevertheless Shapur has to find w原创 2017-05-16 16:51:55 · 559 阅读 · 0 评论 -
hdu 5877 树状数组 +离散化 +树
题解:对于单个节点而言,可以讨论以这个节点为v,有多少祖先和其相乘满足条件,即算单点对答案的贡献度。这题很容易就能转化成:对单个节点而言,统计比当前节点大的祖先k/ai;由此,可以用树状数组维护从根节点开始的k/ai值。每遍历到一个节点,求出树状数组里比当前ai大的数的个数。再将其的k/ai值植入树状数组。还有一点遍历过的节点要及时删除。#include <bits/stdc++.h>using原创 2017-06-20 15:00:50 · 393 阅读 · 0 评论 -
hdu 5869 求区间不同gcd数 离线+树状数组+rmq二分
This is a simple problem. The teacher gives Bob a list of problems about GCD (Greatest Common Divisor). After studying some of them, Bob thinks that GCD is so interesting. One day, he comes up with a n原创 2017-06-21 11:22:19 · 607 阅读 · 0 评论 -
hdu 5792 思维+树状数组
Given a sequence A with length n,count how many quadruple (a,b,c,d) satisfies: a≠b≠c≠d,1≤a#include <bits/stdc++.h>using namespace std;const int N = 50010;int a[N],b[N];int id[N];int qx[N],qd[N],hx原创 2017-09-02 01:26:03 · 299 阅读 · 0 评论 -
codeforces 840E (树状数组+离散化+缩点)
There is an infinite sequence consisting of all positive integers in the increasing order: p = {1, 2, 3, …}. We performed n swap operations with this sequence. A swap(a, b) is an operation of swapping原创 2017-09-27 01:14:52 · 476 阅读 · 0 评论 -
poj 2763(树链剖分)边剖(树状数组版)
After their royal wedding, Jiajia and Wind hid away in XX Village, to enjoy their ordinary happy life. People in XX Village lived in beautiful huts. There are some pairs of huts connected by bidirecti原创 2017-10-03 21:02:26 · 380 阅读 · 0 评论 -
hdu 5517(二维树状数组)
Given the finite multi-set AA of nn pairs of integers, an another finite multi-set BB of mm triples of integers, we define the product of AA and BB as a multi-set C=A∗B={⟨a,c,d⟩∣⟨a,b⟩∈A, ⟨c,d,e⟩∈B and原创 2017-09-29 01:00:51 · 624 阅读 · 0 评论 -
树状数组模版
转 大神 :http://blog.csdn.net/acmmmm/article/details/9850687一维数组数组形式int c[N], maxn; inline int Lowbit(int x){return x&(-x);} void change(int i, int x)//i点增量为x { while(i <= maxn) {转载 2017-05-16 16:56:05 · 338 阅读 · 0 评论 -
hdu 5892 沈阳网络赛 二维树状数组+状态压缩
题目大意:有50种动物,给你n*n的矩阵,m次操作,P代表加入操作,在左上角 x1,y1 到右下角 x2,y2,的矩形范围内加入种类为x,数量为y的动物。Q代表询问操作,在左上角 x1,y1 到右下角 x2,y2,对于1~50种动物,如果数量之和为偶数,输出1,否则输出2。点1:涉及到二维的区间查询更新,应该是用树状数组,怎么更新呢。因为只用到奇偶性,所以 先猜想再一维上,如果普通的单点更新,如果是原创 2017-05-15 09:43:44 · 467 阅读 · 0 评论 -
poj 2528
The citizens of Bytetown, AB, could not stand that the candidates in the mayoral election campaign have been placing their electoral posters at all places at their whim. The city council has finally de原创 2016-12-17 23:16:30 · 300 阅读 · 0 评论 -
POJ 3468 A Simple Problem with Integers(树状数组)
集训队已经开到树状数组,而我才刚学会线段树的基本,而且动归虽然接触过,但是还没练过。 For the k-th number, we all should be very familiar with it. Of course,to kiki it is also simple. Now Kiki meets a very similar problem, kiki wants to design原创 2016-12-18 14:43:54 · 304 阅读 · 0 评论 -
hdu 2852
集训队已经开到树状数组,而我才刚学会线段树的基本,而且动归虽然接触过,但是还没练过。 For the k-th number, we all should be very familiar with it. Of course,to kiki it is also simple. Now Kiki meets a very similar problem, kiki wants to design原创 2016-12-16 21:13:39 · 531 阅读 · 0 评论 -
poj 1990
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, pi原创 2016-12-30 11:37:25 · 341 阅读 · 0 评论 -
蓝桥 小朋友排队(树状数组)
历届试题 小朋友排队 时间限制:1.0s 内存限制:256.0MB 提交此题 问题描述 n 个小朋友站成一排。现在要把他们按身高从低到高的顺序排列,但是每次只能交换位置相邻的两个小朋友。 每个小朋友都有一个不高兴的程度。开始的时候,所有小朋友的不高兴程度都是0。 如果某个小朋友第一次被要求交换,则他的不高兴程度增加1,如果第二次要求他交换,则他的不高兴程度增加2(即不高兴程度为3原创 2017-01-21 15:09:56 · 545 阅读 · 0 评论 -
Poj 2299
In this problem, you have to analyze a particular sorting algorithm. The algorithm processes a sequence of n distinct integers by swapping two adjacent sequence elements until the sequence is sorted in原创 2016-12-18 00:32:52 · 370 阅读 · 0 评论 -
poj 2155 二维树状数组 二维线段树
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 follow原创 2016-12-23 14:59:04 · 367 阅读 · 0 评论 -
Nested Segments codeforces 652D 树状数组 +离散化
给定n个区间,问你第i个区间包含多少个区间。 数据达到了 1e9,但是量只有2*1e5 离散化即可 一开始想着离散两边,发现不可行,因为离散化两边对真实的区间边界交集有变化 造成不好的影响 所以只能离散一个边,然后利用排序,把一个个区间添加进去,离散右边界,左边界从右到左更新,然后更新右边界,那么区间永远是是最大的那个#include <bits/stdc++.h>using namespa原创 2017-05-26 01:19:38 · 357 阅读 · 0 评论 -
POj 3321 树状数组苹果树
There is an apple tree outside of kaka’s house. Every autumn, a lot of apples will grow in the tree. Kaka likes apple very much, so he has been carefully nurturing the big apple tree.The tree has N for原创 2016-12-22 00:34:37 · 623 阅读 · 0 评论