树状数组
bupt_xycr
欢迎关注我的公众号:算法入门
熟悉
c++
caffe
pytorch
mxnet
tensorflow
深度学习
自动驾驶
点云
图像处理
编程比赛
python
java
展开
-
HDU 1166 敌兵布阵
http://acm.hdu.edu.cn/showproblem.php?pid=1166敌兵布阵Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 46532 Accepted Submission(s): 19738Problem原创 2016-04-21 18:57:01 · 219 阅读 · 0 评论 -
HDU 1556 Color the ball
http://acm.hdu.edu.cn/showproblem.php?pid=1556Color the ballTime Limit: 9000/3000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 10579 Accepted Submission(s): 535原创 2016-04-21 18:59:10 · 209 阅读 · 0 评论 -
POJ 1394 Minimum Inversion Number
http://acm.hdu.edu.cn/showproblem.php?pid=1394Minimum Inversion NumberTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 12139 Accepted Submissi原创 2016-04-21 18:59:07 · 275 阅读 · 0 评论 -
POJ 2299 Ultra-QuickSort
http://poj.org/problem?id=2299Ultra-QuickSortTime Limit: 7000MSMemory Limit: 65536KTotal Submissions: 44687Accepted: 16243DescriptionIn this problem, you have to analyze a particular sorting algorithm原创 2016-04-21 18:59:04 · 162 阅读 · 0 评论 -
HDU 2492 Ping pong
http://acm.hdu.edu.cn/showproblem.php?pid=2492Ping pongTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 4243 Accepted Submission(s): 1570Probl原创 2016-04-21 18:59:02 · 209 阅读 · 0 评论 -
POJ 3321 Apple Tree
http://poj.org/problem?id=3321Apple TreeTime Limit: 2000MSMemory Limit: 65536KTotal Submissions: 20182Accepted: 6129DescriptionThere is an apple tree outside of kaka's house. Every autumn, a lot of ap原创 2016-04-21 18:58:54 · 185 阅读 · 0 评论 -
POJ 1195 Mobile phones(二维树状数组)
http://poj.org/problem?id=1195裸的二维树状数组。#include#include#include#include#include#include#include#include#include#include#include#include #include #include #define maxn 10000+5#define ull unsigned long原创 2016-04-21 18:57:24 · 174 阅读 · 0 评论 -
POJ 2352 Stars
http://poj.org/problem?id=2352感觉这道题目的意思不太好理解,简单的说就是给你一些点的坐标(星的坐标)对于每个星星有等级的划分,那怎么划分等级呢? 规则是对于星(x,y)满足x'解题思路:a[i]数组存i级的星星数目。树状数组用来求和,更改。就是求它前面比它小的个数.#include#include#include#include#include#include#in原创 2016-04-21 18:57:16 · 188 阅读 · 0 评论 -
HOJ 1876经理的烦恼
http://acm.hit.edu.cn/hoj/problem/view?id=1867哎~这道题re了很多次。后来找到原因竟然是 #define maxn 1000010+5 的错误,因为这里的C++提交不支持 宏定义有+的运算改为 #define maxn 1000010就过了解题思路:树状数组C[i]存的是A[i-lowbit[i]+1]~A[i]中的素数的个数。之前进行一下筛原创 2016-04-21 18:57:04 · 252 阅读 · 0 评论 -
数据结构-树状数组讲解
树状数组的作用:树状数组是对一个数组改变某个元素和求和比较实用的数据结构。其中”求和,更改“两部操做的时间复杂度都是O(log(n)),n为数组元素个数。在解题过程中,我们有时需要维护一个数组的前缀和S[i]=A[1]+A[2]+...+A[i]。但是不难发现,如果我们修改了任意一个A[i],S[i]、S[i+1]...S[n]都会发生变化。可以说,每次修改A[i]后,调整前缀和S[]在最坏情况下原创 2016-04-21 19:04:15 · 559 阅读 · 0 评论