线段树,树状数组
zhenggy_
爱生活,爱编程
展开
-
HDU 1394 Minimum Inversion Number
Minimum Inversion Number Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 10207 Accepted Submission(s): 6274 Problem Description原创 2014-07-25 10:16:44 · 508 阅读 · 0 评论 -
UVALive 4329 Ping pong
#include #include using namespace std; struct fwtree { int C[101000], n; void init(int k){ memset(C, 0, sizeof(C)); n = k; } int lowbit(int x) { return x&-x; } void add(int x, int原创 2015-03-15 16:20:47 · 441 阅读 · 0 评论 -
POJ 3067 Japan
#include #include #include #include using namespace std; struct node { int l, r; }a[1000*1001]; bool cmp(const node &a, const node &b) { if(a.l == b.l) return a.r < b.r; re原创 2015-03-15 16:24:29 · 460 阅读 · 0 评论 -
HDU 1166 敌兵布阵 //线段树单点更新
void build(int l, int r, int n) //建树 { int mid; tree[n].l = l; tree[n].r = r; if(l==r) { tree[n].sum = h[l]; return ; } mid = (l+r)>>1; build(l, mid, 2*n); build(mid+1, r, 2*n+1); tree[n].sum = tree[2*n].sum + tree[2*n+1].sum; }原创 2014-07-23 16:59:12 · 766 阅读 · 0 评论 -
POJ 3468 A Simple Problem with Integers //线段树的成段更新
线段树的成段更新lazy操作原创 2014-07-24 11:28:08 · 868 阅读 · 0 评论 -
POJ 3264 Balanced Lineup //简单线段树
Balanced Lineup Time Limit: 5000MS Memory Limit: 65536K Total Submissions: 33405 Accepted: 15671 Case Time Limit: 2000MS Description For the daily milking, Farme原创 2014-07-23 10:55:03 · 653 阅读 · 0 评论 -
HDU 2795 Billboard //线段树简单应用
Billboard Time Limit: 20000/8000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 10074 Accepted Submission(s): 4482 Problem Description At the entranc原创 2014-07-25 15:15:57 · 558 阅读 · 0 评论