树状数组
jiangjiashi
这个作者很懒,什么都没留下…
展开
-
树状数组,很强大。
int read(int k){ int sum=0; while (k>0) { sum+=tree[k]; k-=k&-k; } return sum;}void update(int k,int v){ while (k<=Max) { tree[k]+=v; k原创 2012-04-26 11:34:19 · 369 阅读 · 0 评论 -
star(CD1231)
这个给出的数据是排序好了的,,对y的输入都不用管,#include#include#include#include#include#include#include#include#include#include#include#include#includeusing namespace std;#define N 32004int tree[N]={0},s原创 2012-04-26 12:36:17 · 613 阅读 · 0 评论 -
(简单)color the ball(H1556)
#include#include#include#include#include#include#include#include#include#include#include#include#includeusing namespace std;#define N 200001int n;int tree[N];int find(int k){ in原创 2012-05-06 20:25:51 · 294 阅读 · 0 评论 -
(二维) Matrix (P2155)
这个不能过,我都不知道为什么了,,#include#include#include#include#includeusing namespace std;#define N 2000int n;int q;int go[N][N];int low(int k){ return k&(-k);}void update(int x,int y,int v)原创 2012-07-14 23:59:11 · 485 阅读 · 0 评论 -
Ultra-quiksort (p2299)
这个题,先是数组开小了,然后是输出结果用int存不下。时候超过了1000MS,时间上比较长啊。#include#include#include#include#include#include#include#include#includeusing namespace std;#define N 1111111int n;struct my{原创 2012-07-18 11:03:58 · 463 阅读 · 0 评论 -
Cows P(2481)
这个题还是看了一下别人的才知道的,失败了三#include#include#include#include#include#include#include#include#includeusing namespace std;struct my{ int x,y; int id; bool operator<(my b) { if (x!=原创 2012-07-17 23:19:10 · 684 阅读 · 0 评论 -
(单纯二维) Mobile phones (1195)
注意更新的意义。,只须更新一次就行。他往上更新不是更新所有。#include#include#include#include#include#include#include#include#include#include#include#includeusing namespace std;#define N 1111int s;int l,r,b,原创 2012-08-07 11:38:40 · 446 阅读 · 0 评论