文章分类 -  线段树&树状数组

pku 2155 Matrix（二维树状数组）
摘要：#include <stdio.h>#include <string.h>#include <stdlib.h>#define MAXN 1005int N,c[MAXN][MAXN];inline int lowbit(int x){ return x&(-x);}void update(int x,int y,int delta){ while(x&... 阅读全文
posted @ 2010-09-12 10:54 菜到不得鸟 阅读(150) 评论(0) 推荐(0)
hdu 1394 Minimum Inversion Number(最小逆序数)
摘要：#include <stdio.h>#include <string.h>typedef long long LL;#define MAXN 5005int n,a[MAXN],c[MAXN];inline int lowbit(int x){ return x&(-x);}void update(int x,int delta){ while(x<=n) {... 阅读全文
posted @ 2010-09-11 09:23 菜到不得鸟 阅读(122) 评论(0) 推荐(0)
pku 2481 Cows(树状数组)
摘要：题意转为统计(x,y)的右上方的点数有多少，和Stars差不多，不过注意重合的区间离散化X，2724K,1079MS#include <stdio.h>#include <string.h>#include <algorithm>using namespace std;#define MAXN 100010struct PNode{ int x,y; int i... 阅读全文
posted @ 2010-09-07 23:36 菜到不得鸟 阅读(149) 评论(0) 推荐(0)
pku 3067 Japan(变相逆序数)
摘要：#include <stdio.h>#include <string.h>#include <algorithm>using namespace std;#define MAXN 1010#define MAXK 500010struct HNode{ int x,y;}highway[MAXK];inline bool mycmp(const HNode &a... 阅读全文
posted @ 2010-09-07 22:14 菜到不得鸟 阅读(131) 评论(0) 推荐(0)
pku 2299 Ultra-QuickSort(求逆序数)
摘要：树状数组 7420K 500MS#include <stdio.h>#include <string.h>#include <algorithm>using namespace std;typedef long long LL;#define MAXN 500010int n,ihash[MAXN],c[MAXN];struct SNode{ int val,i... 阅读全文
posted @ 2010-09-07 20:30 菜到不得鸟 阅读(129) 评论(0) 推荐(0)
hdu 1556 Color the ball(可不用树状数组)
摘要：普通数组 312MS#include <stdio.h>#include <string.h>#define MAXN 100010int n,section[MAXN];int main(){ int i,j,k; while(scanf("%d",&n),n) { memset(section,0,sizeof(section)); for(k=0;k<n... 阅读全文
posted @ 2010-09-07 18:37 菜到不得鸟 阅读(446) 评论(1) 推荐(0)
hdu 1541 Stars(树状数组)
摘要：#include <stdio.h>#include <string.h>#include <algorithm>using namespace std;#define MAXN 32005int n,c[MAXN],num[MAXN],inx[MAXN],sorted[MAXN],xhash[MAXN];inline int lowbit(int x){ re... 阅读全文
posted @ 2010-09-06 23:56 菜到不得鸟 阅读(262) 评论(0) 推荐(0)
hdu 3473 Minimum Sum(划分树)
摘要：375MS 30512K#include <stdio.h>#include <algorithm>using namespace std;typedef long long LL;#define MAXN 100005#define MAXLOG 20int sorted[MAXN],seq[MAXLOG][MAXN],toleft[MAXLOG][MAXN];LL to... 阅读全文
posted @ 2010-09-05 22:29 菜到不得鸟 阅读(299) 评论(0) 推荐(0)
hdu 2665 Kth number(划分树)
摘要：http://acm.tju.edu.cn/toj/showp2722.html 同样的题目#include <stdio.h>#include <algorithm>using namespace std;#define MAXN 100005#define MAXLOG 20int sorted[MAXN],seq[MAXLOG][MAXN],toleft[MAXLOG... 阅读全文
posted @ 2010-09-05 10:59 菜到不得鸟 阅读(305) 评论(0) 推荐(0)
hdu 1698 Just a Hook(线段更新)
摘要：#include <stdio.h>#include <string.h>#include <stdlib.h>#define MAXN 100000*3struct STNode{ int l,r,cover,kink; //记住cover为完全覆盖};STNode node[MAXN];void build(int a,int b,int idx){ nod... 阅读全文
posted @ 2010-09-01 17:06 菜到不得鸟 阅读(172) 评论(0) 推荐(0)
hdu 1166 敌兵布阵
摘要：线段树 46MS#include <stdio.h>#define MAXN 50005int number[MAXN];struct STNode{ int l,r,num;};STNode node[MAXN*3];void build(int a,int b,int idx){ node[idx].l=a; node[idx].r=b; if(a==b) { node[idx].... 阅读全文
posted @ 2010-09-01 15:43 菜到不得鸟 阅读(160) 评论(0) 推荐(0)
hdu 1754 I Hate It(基础线段树)
摘要：#include <stdio.h>#define MAXSIZE 200001int stu[MAXSIZE];struct seg_tree{ int l,r,max;};seg_tree tree[MAXSIZE*3];inline int Max(int a,int b){ return a>b?a:b;}void build(int a,int b,int idx){ ... 阅读全文
posted @ 2010-08-30 22:41 菜到不得鸟 阅读(260) 评论(0) 推荐(0)
hdu 1823 Luck and Love(二维线段树)
摘要：认真+小心#include <stdio.h>#define MAXSUB 1000*3#define MAXMAIN 100*3#define INF -1.1inline double Max(double a,double b){ return a>b?a:b;}struct SubNode{ int l,r; double maxv;};class SubTree{pub... 阅读全文
posted @ 2010-08-30 22:40 菜到不得鸟 阅读(325) 评论(0) 推荐(0)