[HDU - 1166] 敌兵布阵 线段树/树状数组板子题

题目链接：敌兵布阵

题意

中文题意，我就不多说了

题解

线段树点修改的板子/树状数组板子

代码

线段树

#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cstring>
#include<bitset>
#include<cassert>
#include<cctype>
#include<cmath>
#include<cstdlib>
#include<ctime>
#include<deque>
#include<iomanip>
#include<list>
#include<map>
#include<queue>
#include<set>
#include<stack>
#include<vector>
using namespace std;
//extern "C"{void *__dso_handle=0;}
typedef long long ll;
typedef long double ld;
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define pii pair<int,int>

const double PI=acos(-1.0);
const double eps=1e-6;
const ll mod=1e9+7;
const int inf=0x3f3f3f3f;
const int maxn=1e5+10;
const int maxm=100+10;
#define ios ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);

int a[maxn],tree[maxn];
void build(int p,int l,int r)
{
	if(l==r) { tree[p]=a[l]; return ;}
	int mid=l+(r-l)/2;
	build(p*2, l, mid);
	build(p*2+1,mid+1,r);
	tree[p]=tree[p*2]+tree[p*2+1];
}
void add(int p,int l,int r,int num,int v)
{
	int mid=l+(r-l)/2;
	if(l==r) { tree[p]+=v; return; }
	if(num<=mid) add(p*2,l, mid, num, v); else add(p*2+1, mid+1, r, num, v);
	tree[p]=tree[p*2]+tree[p*2+1];
}
int query(int p,int l,int r,int ql,int qr)
{
	int mid=l+(r-l)/2,ans=0;
	if(ql<=l && qr>=r) return tree[p];
	if(ql<=mid) ans+=query(p*2, l, mid, ql, qr);
	if(mid<qr) ans+=query(p*2+1, mid+1, r, ql, qr);
	return ans;
}

int main()
{
	int t;
	scanf("%d",&t);
	for(int cas=1;cas<=t;cas++)
	{
		int n;
		scanf("%d",&n);
		for(int i=1;i<=n;i++) scanf("%d",&a[i]);
		printf("Case %d:\n",cas);
		build(1, 1, n);
		int q;
		string s;
		while(cin >> s)
		{
			if(s=="Add")
			{
				int num,v;
				scanf("%d%d",&num,&v);
				add(1, 1, n, num, v);
			}
			else if(s=="Sub")
			{
				int num,v;
				scanf("%d%d",&num,&v);
				v=-v;
				add(1, 1, n, num, v);
			}
			else if(s=="End")
			{
				break ;
			}
			else
			{
				int l,r;
				scanf("%d%d",&l,&r);
				cout << query(1, 1, n,l,r) << endl;	
			}
		}
	}
}

树状数组

#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cstring>
#include<bitset>
#include<cassert>
#include<cctype>
#include<cmath>
#include<cstdlib>
#include<ctime>
#include<deque>
#include<iomanip>
#include<list>
#include<map>
#include<queue>
#include<set>
#include<stack>
#include<vector>
using namespace std;
//extern "C"{void *__dso_handle=0;}
typedef long long ll;
typedef long double ld;
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define pii pair<int,int>
#define lowbit(x) x&-x

const double PI=acos(-1.0);
const double eps=1e-6;
const ll mod=1e9+7;
const int inf=0x3f3f3f3f;
const int maxn=1e5+10;
const int maxm=100+10;
#define ios ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);

int a[maxn],c[maxn];
int n;
int sum(int x)
{
	int ans=0;
	while(x>0)
	{
		ans+=c[x],x-=lowbit(x);
	}
	return ans;
}
void add(int x,int num)
{
	while (x<=n) {
		c[x]+=num,x+=lowbit(x);
	}
}
int main()
{
	int t;
	scanf("%d",&t);
	for(int cas=1;cas<=t;cas++)
	{
		memset(c, 0, sizeof(c));
		scanf("%d",&n);
		for(int i=1;i<=n;i++) 
		{
			scanf("%d",&a[i]);
			add(i, a[i]);
		}
		printf("Case %d:\n",cas);
		int q;
		string s;
		while(cin >> s)
		{
			if(s=="Add")
			{
				int num,v;
				scanf("%d%d",&num,&v);
				add(num, v);
			}
			else if(s=="Sub")
			{
				int num,v;
				scanf("%d%d",&num,&v);
				v=-v;
				add(num, v);
			}
			else if(s=="End") break ;
			else
			{
				int l,r;
				scanf("%d%d",&l,&r);
				printf("%d\n",sum(r)-sum(l-1));
			}
		}
	}
}