几道线段树的代码_线段树c语言代码-CSDN博客

本文链接：https://blog.csdn.net/vasile010/article/details/4971254

本文介绍了使用线段树解决编程竞赛中多个典型问题的方法，包括区间更新与查询、最大值更新查询等，并通过具体题目如HDU1166、HDU1754、HDU1698、PKU2528和PKU2777展示了解题思路与实现细节。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

解题报告在百度 http://hi.baidu.com/%D2%D5%C1%D6010/blog/category/%D7%D6%B7%FB%B4%AE

hdu1166

/*hdu 1166*/ #include<iostream> using namespace std; const int size = 50002; const int add = 1; const int sub = 0; struct Seg_tree { int Lef, Rig; int Num; int Mid() { return ((Lef+Rig)>>1); } }seg[size*4]; void Creat(int le, int ri, int num) { seg[num].Lef = le; seg[num].Rig = ri; seg[num].Num = 0; if (le == ri) return; int mid = seg[num].Mid(); Creat(le,mid , 2*num); Creat(mid+1, ri, 2*num+1);/*Don't forget add 1*/ } void Update(int i, int n, int num) { seg[num].Num += n; /*if (seg[num].Num<0)seg[num].Num = 0;不要多次一举，否则wa*/ if (seg[num].Lef == seg[num].Rig) return; int mid = seg[num].Mid(); if (i <= mid) Update(i, n, 2*num); else Update(i, n, 2*num+1); } int total; void Cal(int le, int ri, int num) { if (seg[num].Lef == le && seg[num].Rig == ri) { total += seg[num].Num; return; } if (seg[num].Lef == seg[num].Rig||le>ri) return; int mid = seg[num].Mid(); if (le > mid) Cal(le, ri, 2*num+1); else if (ri <= mid) Cal(le, ri, 2*num); else { Cal(le,mid, 2*num); Cal(mid+1, ri, 2*num+1); } } int main() { int T, N, i, j, number, tt = 1; char order[10]; scanf("%d",&T); while (T--) { scanf("%d",&N); Creat(1,N,1); for (i = 1; i <= N; i++) { scanf("%d", &number); Update(i,number,1); } printf("Case %d:/n", tt++); while (scanf("%s",order)&&order[0]!='E') { scanf("%d %d",&i, &j); if (order[0]=='A') Update(i,j,1); else if ('S' == order[0]) Update(i, -j, 1); else { total = 0; Cal(i, j,1); printf("%d/n",total); } } } return 0; }

hdu1754

/*hdu1754*/ #include<iostream> using namespace std; #define DUB(a) (a<<1) const int size = 200002; int Socer[size]; struct Seg_Tree { int Lef, Rig, Soc; int Mid() { return ((Lef+Rig)>>1); } }seg[size*3]; int Creat(int le, int ri, int num) { seg[num].Lef = le; seg[num].Rig = ri; if (le == ri) return seg[num].Soc = Socer[le]; int mid = seg[num].Mid(); return seg[num].Soc = max( Creat(le, mid, DUB(num)), Creat(mid+1, ri, (DUB(num)+1))); } void Update(int a, int b, int num) { seg[num].Soc = max(seg[num].Soc, b); if (seg[num].Lef == seg[num].Rig) { if (seg[num].Lef == a) seg[num].Soc = b; return; } int mid = seg[num].Mid(); if (a <= mid) Update(a, b, DUB(num)); else Update(a, b, DUB(num)+1); } int Query(int le, int ri, int num) { if (seg[num].Lef == le && seg[num].Rig == ri) return seg[num].Soc; if (seg[num].Lef == seg[num].Rig) return 0; int mid = seg[num].Mid(); if (le > mid) return Query(le, ri, DUB(num)+1); else if (ri <= mid) return Query(le, ri, DUB(num)); else return max(Query(mid+1, ri, DUB(num)+1), Query(le, mid, DUB(num))); } int main() { int i, j, N, M, A, B; char order[3]; while (scanf("%d%d",&N,&M)!=EOF) { for (i = 1; i <= N; i++) scanf("%d", &Socer[i]); Creat(1, N, 1); for (j = M; j > 0; j--) { scanf("%s%d%d",order,&A,&B); if (order[0]=='U') Update(A, B, 1); else printf("%d/n",Query(A, B, 1)); } } return 0; }

hdu1698

/*hdu1698*/ #include<iostream> using namespace std; #define LL(a) (a<<1) const int size = 100003; struct Seg_Tree { int Left, Right, Cover; int Mid() {return ((Left+Right)>>1);} int Val() {return (Right-Left+1)*Cover;} }seg[size*3]; void Creat(int lef, int rig, int num) { seg[num].Left = lef; seg[num].Right = rig; seg[num].Cover = 1; if (lef == rig) return ; Creat(lef, seg[num].Mid(), LL(num)); Creat(seg[num].Mid()+1, rig, LL(num)+1); } void Update(int lef, int rig, int cov, int num) { if (lef <= seg[num].Left && seg[num].Right <= rig) { seg[num].Cover = cov; return ; } if (seg[num].Cover && seg[num].Cover != cov) { seg[LL(num)+1].Cover = seg[LL(num)].Cover = seg[num].Cover; seg[num].Cover = 0; } int mid = seg[num].Mid(); if (lef > mid) Update(lef, rig, cov, LL(num)+1); else if (rig <= mid) Update(lef, rig, cov, LL(num)); else { Update(lef, mid, cov, LL(num)); Update(mid+1, rig, cov, LL(num)+1); } } int Query(int num) { if (seg[num].Cover) return seg[num].Val(); if (seg[num].Left == seg[num].Right) return 0; return Query(LL(num))+Query(LL(num)+1); } int N, M, T, X, Y, Z; int main() { int i, j; scanf("%d",&T); for (i = 1; i <= T; i++) { scanf("%d%d",&N,&M); Creat(1,N,1); for (j = M; j > 0; j--) { scanf("%d%d%d", &X,&Y,&Z); Update(X, Y, Z, 1); } printf("Case %d: The total value of the hook is %d./n",i, Query(1)); } return 0; }

pku2528

/*pku2528*/ /*注意此题线段树数组的大小，应为离散化后的3、4倍所以开7倍*/ #include<iostream> #include<algorithm> using namespace std; #define LL(a) (a<<1) const int size = 10003; struct Seg_Tree { int Left, Right, Cover; int Mid() {return ((Left+Right)>>1);} }seg[size*4]; bool Hash[size]; int R[size][2], Shine[size*2], N, M; void Creat(int lef, int rig, int num) { seg[num].Left = lef; seg[num].Right = rig; seg[num].Cover = 0; if (lef == rig) return ; Creat(lef, seg[num].Mid(), LL(num)); Creat(seg[num].Mid()+1, rig, 1+LL(num)); } void Update(int lef, int rig, int cov, int num) { if (lef <= seg[num].Left && seg[num].Right <= rig) { seg[num].Cover = cov; return; } if (seg[num].Cover && seg[num].Cover != cov) { seg[LL(num)].Cover = seg[LL(num)+1].Cover = seg[num].Cover; seg[num].Cover = 0; } int mid = seg[num].Mid(); if (lef > mid) Update(lef, rig, cov, 1+LL(num)); else if (rig <= mid) Update(lef, rig, cov, LL(num)); else { Update(lef, mid, cov, LL(num)); Update(mid+1, rig, cov, 1+LL(num)); } } int Ans = 0; void Query(int num) { if (seg[num].Cover) { if (!Hash[seg[num].Cover]) {Ans++; Hash[seg[num].Cover] = 1;} return; } if (seg[num].Left == seg[num].Right) return; Query(LL(num)); Query(1+LL(num)); } int Binary(int x) { int l = 1, r = M, mid; while (l <= r) { mid = ((l+r)>>1); if (Shine[mid] == x) return mid; if (Shine[mid] < x) l = mid+1; else r = mid - 1; } } int main() { int T, i, j; Shine[0] = 13125400; scanf("%d",&T); while (T--) { memset(Hash, 0, sizeof(Hash)); M = Ans = 0; scanf("%d",&N); for (i = 1; i <= N; i++) { scanf("%d%d", &R[i][0], &R[i][1]); Shine[LL(i)] = R[i][0]; Shine[LL(i)-1] = R[i][1]; } j = LL(N); sort(Shine+1, Shine+1+j); for (i = 1; i <= j; i++) if (Shine[i] != Shine[i-1]) { M++; Shine[M] = Shine[i]; } Creat(1, M, 1); for (i = 1; i <= N; i++) Update(Binary(R[i][0]), Binary(R[i][1]), i, 1); Query(1); printf("%d/n",Ans); } return 0; }

pku2777

/*pku2777*/ #include<cstdio> #include<cstring> #define LL(a) (a<<1) const int size = 100003; int L, T, O; bool Hash[35]; struct Seg_Tree { int Left, Right, Cover; int Mid() {return ((Left+Right)>>1);} }seg[size*3]; void Creat(int lef, int rig, int num) { seg[num].Left = lef; seg[num].Right = rig; seg[num].Cover = 1; if (lef == rig) return; Creat(lef, seg[num].Mid(), LL(num)); Creat(seg[num].Mid()+1, rig, 1+LL(num)); } void Update(int lef, int rig, int cov, int num) { if (lef <= seg[num].Left && seg[num].Right <= rig) { seg[num].Cover = cov; return; } if (seg[num].Cover && seg[num].Cover != cov) { seg[1+LL(num)].Cover = seg[LL(num)].Cover = seg[num].Cover; seg[num].Cover = 0; } int mid = seg[num].Mid(); if (lef > mid) Update(lef, rig, cov, 1+LL(num)); else if (rig <= mid) Update(lef, rig, cov, LL(num)); else { Update(lef, mid, cov, LL(num)); Update(mid+1, rig, cov, LL(num)+1); } } int Ans = 0; void Query(int lef, int rig, int num) { if (seg[num].Cover) { if (!Hash[seg[num].Cover])/*开始把这个条件放在外层，然后就果断wa*/ { Ans ++; Hash[seg[num].Cover] = 1; } return ; } if(seg[num].Left == seg[num].Right) return ; int mid = seg[num].Mid(); if (lef > mid) Query(lef, rig, 1+LL(num)); else if (rig <= mid) Query(lef, rig, LL(num)); else { Query(lef, mid, LL(num)); Query(mid+1, rig, 1+LL(num)); } } void Swap(int &a, int &b) { int c = a; if (a > b) { a = b; b = c; } } int main() { char order[3]; int i, A, B, C; while (scanf("%d%d%d",&L,&T,&O)!=EOF) { Creat(1,L,1); for (i = 0; i < O; i++) { scanf("%s",order); switch(order[0]) { case 'C': scanf("%d%d%d",&A,&B,&C); Swap(A,B); Update(A,B,C,1); break; case 'P': scanf("%d%d",&A,&B); Swap(A,B); Ans = 0; memset(Hash, 0,sizeof(Hash)); Query(A,B,1); printf("%d/n",Ans); } } } return 0; }