![](https://img-blog.csdnimg.cn/20201014180756780.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
HDU
格戮
从菜鸟到小白
展开
-
HDU1556 (树状数组)
#include<stdio.h>#include<algorithm>using namespace std;void alter(int i,int n,int a[],int v){ while(i<=n){ a[i]+=v; i+=i&-i; }}int search(int i,int a[]){ int sum=0; wh...原创 2020-03-23 11:33:01 · 126 阅读 · 0 评论 -
HDU1541(树状数组)
#include<stdio.h>#include<algorithm>using namespace std;void alter(int i,int n,int T[]) { while(i<=n) { T[i]++; i+=i&-i; }}int search(int i,int T[]) { int sum=0; while(...原创 2020-03-23 09:41:34 · 108 阅读 · 0 评论 -
HDU1754(线段树)
#include<stdio.h>int T[600006];void build(int l,int r,int i) { if(l==r) { scanf("%d",&T[i]); return; } int mid=(l+r)/2; build(l,mid,i*2); build(mid+1,r,...原创 2020-03-22 19:32:05 · 149 阅读 · 0 评论 -
HDU1166(线段树)
#include<stdio.h>int T[150005];void build(int l,int r,int i) { if(l==r) { scanf("%d",&T[i]); return; } int mid=(l+r)/2; build(l,mid,i*2); build(mid+1,r,...原创 2020-03-22 19:30:50 · 125 阅读 · 0 评论