templte_树状数组

#include <stdio.h>
#include <string.h>
#include <iostream>
#include <string>

using namespace std;

const int MAXN = 100 + 11;

int N, M;

int C[MAXN];

int lowbit(int x)
{
	return x & (-x);
}

void add(int x, int val)
{
	for (int i = x; i <= N; i += lowbit(i))
	{
		C[i] += val;
	}
}

int sum(int x)
{
	int s = 0;
	for (int i = x; i > 0; i -= lowbit(i))
	{
		s += C[i];
	}
	return s;
}

int main()
{
	while (scanf("%d%d", &N, &M) != EOF)
	{
		int a;
		for (int i = 1; i <= N; i++)
		{
			scanf("%d", &a);
			add(i, a);
		}
		for (int i = 0; i < M; i++)
		{
			int l, r;
			scanf("%d%d", &l, &r);
			printf("The ans is : %d\n", sum(r) - sum(l - 1));
		}
	}
	system("pause");
	return 0;
}