POJ-3264

我的第一道线段树，找了一道最水的刷了一下。。就是求区间的最大值和最小值，先从简单的起步吧

#include<cstdio>
#include<algorithm>
#include<climits>

using namespace std;

namespace
{
	const int MAX_N = 1 << 16;
	int n, N, Q, A, B;

	struct Cow
	{
		int small, large;
	} d[2 * MAX_N - 1];

	void init()
	{
		n = 1;
		while (n < N)
			n <<= 1;
		for (int i = 0; i < 2 * n - 1; i++)
		{
			d[i].small = INT_MAX;
			d[i].large = 0;
		}
	}

	void update(int k, int a)
	{
		k += n - 1;
		d[k].small = d[k].large = a;
		while (k)
		{
			k = (k - 1) >> 1;
			d[k].small = min(d[2 * k + 1].small, d[2 * k + 2].small);
			d[k].large = max(d[2 * k + 1].large, d[2 * k + 2].large);
		}
	}

	pair<int, int> query(int k, int l, int r)
	{
		if (r <= A || l >= B)
			return make_pair(INT_MAX, 0);
		if (A <= l && r <= B)
			return make_pair(d[k].small, d[k].large);
		else
		{
			pair<int, int> p1 = query(2 * k + 1, l, (l + r) / 2);
			pair<int, int> p2 = query(2 * k + 2, (l + r) / 2, r);
			return make_pair(min(p1.first, p2.first), max(p1.second, p2.second));
		}
	}

	void solve()
	{
		A -= 1;
		pair<int, int> p = query(0, 0, n);
		printf("%d\n", p.second - p.first);
	}
}

int main()
{
	scanf("%d %d", &N, &Q);
	init();
	int temp;
	for (int i = 0; i < N; i++)
	{
		scanf("%d", &temp);
		update(i, temp);
	}
	while (Q--)
	{
		scanf("%d %d", &A, &B);
		solve();
	}
	return 0;
}

今天又看了书上的Sparse Table写法，按着思路写了一遍，代码简短了一些，但是内存使用增加了好多，时间没什么变化。。就当练习吧

#include<cstdio>
#include<cstring>
#include<algorithm>

using namespace std;

namespace
{
	int A, B, N, Q, s[16][50000], t[16][50000];

	void init()
	{
		bool finish = false;
		for (int i = 1; !finish; i++)
		{
			finish = true;
			for (int j = 0;; j++)
			{
				int end = j + (1 << (i - 1));
				if (end < N && s[i - 1][end])
				{
					s[i][j] = min(s[i - 1][j], s[i - 1][end]);
					t[i][j] = max(t[i - 1][j], t[i - 1][end]);
					finish = false;
				}
				else
					break;
			}
		}
	}

	void solve()
	{
		A--;
		int d = 31 - __builtin_clz(B - A);
		int y = B - (1 << d);
		printf("%d\n", max(t[d][A], t[d][y]) - min(s[d][A], s[d][y]));
	}
}

int main()
{
	scanf("%d %d", &N, &Q);
	memset(s, 0, sizeof(s));
	memset(t, 0, sizeof(t));
	for (int i = 0; i < N; i++)
	{
		scanf("%d", &s[0][i]);
		t[0][i] = s[0][i];
	}
	init();
	while (Q--)
	{
		scanf("%d %d", &A, &B);
		solve();
	}
	return 0;
}