RMQ（一维+二维）附例题 POJ 3264，POJ 2019

最新推荐文章于 2019-08-14 11:04:56 发布

winer_bamboo

最新推荐文章于 2019-08-14 11:04:56 发布

阅读量179

点赞数

分类专栏： RMQ 文章标签： RMQ POJ

本文链接：https://blog.csdn.net/weixin_43741224/article/details/95764036

版权

RMQ 专栏收录该内容

1 篇文章 0 订阅

订阅专栏

代码功能

众所周之，求区间最值对于ACMer来说，是必须掌握的，为此我将之贴一下，注解也比较详细，方便查阅。

这段代码能够求一段连续的数在任意区间的最值。

代码区（一维+详细说明）

#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>
#include<queue>
#include<string>
#include<cmath>
#include<fstream>
#include<vector>
#include<stack>
#include <map>
#define bug cout << "**********" << endl
//#define LOCAL = 1;
using namespace std;
typedef long long ll;
const int inf = 0x3f3f3f3f;
const int mod = 1e8;
const int Max = 1e5 + 10;
int n, m;						        //n代表区间长度，也就是数据量; m 代表查询次数
int dist[Max];					        //记录数据
int Log[Max];					        //Log[i]向下取整
int max_dis[Max][20], min_dis[Max][20];	//max_dis[i][j]记录区间	[i,i + (1<<j)-1] 的最大值

void RMQ()
{
	Log[0] = -1;
	for (int i = 1; i <= n; i++)		//求Log[i]向下取整，倍增
		Log[i] = Log[i >> 1] + 1;

	for (int i = 1;i <= n; i++)
	{
		max_dis[i][0] = dist[i];
		min_dis[i][0] = dist[i];		//初始化，长度为1的区间的最值
	}
	for (int j = 1;j <= Log[n]; j++)	//从小区间开始向大区间枚举，依次枚举长度为 2^j 的区间
	{
		for (int i = 1; i <= n; i++)	//枚举起点
		{
			if (i + (1 << j) - 1 <= n)	//判断合法性，不能够越界
			{
				max_dis[i][j] = max(max_dis[i][j - 1], max_dis[i + (1 << (j - 1))][j - 1]);
				min_dis[i][j] = min(min_dis[i][j - 1], min_dis[i + (1 << (j - 1))][j - 1]);
				//求[i,i+(1<<j)-1]区间的最值等于求其子区间 [i,i+(1<<(j-1))-1] 和 [i+(1<<(j-1)),i+(1<<j)-1]中最值的最值（有点绕，就是最值的意思）
				//有点动态规划的味道，根据子区间最优解得到区间的最优解
			}
		}
	}
}


int getMax(int l, int r)
{
	int x = Log[r - l + 1];		//折半查找的区间长度
	return max(max_dis[l][x], max_dis[r - (1 << x) + 1][x]);
}

int getMin(int l, int r)
{
	int x = Log[r - l + 1];		//折半查找的区间长度
	return min(min_dis[l][x], min_dis[r - (1 << x) + 1][x]);
}

int main()
{
#ifdef LOCAL
	freopen("input.txt", "r", stdin);
	freopen("output.txt", "w", stdout);
#endif
	printf("请输入数据个数: ");
	scanf("%d", &n);
	printf("请输入%d个数据\n", n);
	for (int i = 1;i <= n; i++)
	{
		scanf("%d", dist + i);
	}
	RMQ();
	printf("请输入查询次数: ");
	scanf("%d", &m);
	while (m--)
	{
		printf("请输入要查询的区间: ");
		int r, l;
		scanf("%d%d", &l, &r);
		printf("区间最大值: %d\n区间最小值为: %d\n\n", getMax(l, r), getMin(l, r));
	}
	return 0;
}

POJ 2019

二维RMQ的模板题，和一维RMQ的思路差不多的，只是要扩展到二维，查询是要从四个角进行比较。（不仔细观察，容易出现小问题！）

代码区（二维）

#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>
#include<queue>
#include<string>
#include<cmath>
#include<fstream>
#include<vector>
#include<stack>
#include <map>
#define bug cout << "**********" << endl
//#define LOCAL = 1;
using namespace std;
typedef long long ll;
const int inf = 0x3f3f3f3f;
const int mod = 1e8;
const int Max = 3e2 + 10;

int n, b, k;
short lg[Max];
short max_dis[Max][10][Max][10];
short min_dis[Max][10][Max][10];

void ST()
{
	lg[0] = -1;
	for (int i = 1; i <= n;i++)
		lg[i] = 1 + lg[i >> 1];

	for (int r = 0; r <= lg[n];r++)
	{
		for (int c = 0; c <= lg[n]; c++)
		{
			if (r == 0 && c == 0)continue;
			for (int row = 1; row + (1 << r) - 1 <= n; row++)
			{
				for (int col = 1; col + (1 << c) - 1 <= n; col++)
				{
					if (r == 0)
					{
						max_dis[row][r][col][c] = max(max_dis[row][r][col][c - 1], max_dis[row][r][col + (1 << (c - 1))][c - 1]);
						min_dis[row][r][col][c] = min(min_dis[row][r][col][c - 1], min_dis[row][r][col + (1 << (c - 1))][c - 1]);
					}
					else if (c == 0)
					{
						max_dis[row][r][col][c] = max(max_dis[row][r - 1][col][c], max_dis[row + (1 << (r - 1))][r - 1][col][c]);
						min_dis[row][r][col][c] = min(min_dis[row][r - 1][col][c], min_dis[row + (1 << (r - 1))][r - 1][col][c]);
					}
					else
					{
						max_dis[row][r][col][c] = max(max_dis[row][r][col][c - 1], max_dis[row][r][col + (1 << (c - 1))][c - 1]);
						min_dis[row][r][col][c] = min(min_dis[row][r][col][c - 1], min_dis[row][r][col + (1 << (c - 1))][c - 1]);
					}
				}
			}
		}
	}
}

int getMax(int row1, int col1, int row2, int col2)
{
	int x = lg[row2 - row1 + 1];
	int y = lg[col2 - col1 + 1];

	short temp = max(max_dis[row1][x][col1][y], max_dis[row2 - (1 << x) + 1][x][col1][y]);

	temp = max(temp, max(max_dis[row1][x][col2 - (1 << y) + 1][y], max_dis[row2 - (1 << x) + 1][x][col2 - (1 << y) + 1][y]));

	return temp;
}

int getMin(int row1, int col1, int row2, int col2)
{
	int x = lg[row2 - row1 + 1];
	int y = lg[col2 - col1 + 1];

	short temp = min(min_dis[row1][x][col1][y], min_dis[row2 - (1 << x) + 1][x][col1][y]);

	temp = min(temp, min(min_dis[row1][x][col2 - (1 << y) + 1][y], min_dis[row2 - (1 << x) + 1][x][col2 - (1 << y) + 1][y]));

	return temp;
}


int main()
{
#ifdef LOCAL
	freopen("input.txt", "r", stdin);
	freopen("output.txt", "w", stdout);
#endif
	while (scanf("%d%d%d", &n, &b, &k) != EOF)
	{
		for (int i = 1; i <= n;i++)
		{
			for (int j = 1; j <= n;j++)
			{
				short x;
				scanf("%hd", &x);
				max_dis[i][0][j][0] = x;
				min_dis[i][0][j][0] = x;
			}
		}
		ST();
		while (k--)
		{
			int row, col;
			scanf("%d%d", &row, &col);
			printf("%d\n", getMax(row, col, row + b - 1, col + b - 1) - getMin(row, col, row + b - 1, col + b - 1));
		}
	}
	return 0;
}

POJ 3264

这个妥妥的模板题，把上面模板稍微改动即可。

代码区

#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>
#include<queue>
#include<string>
#include<cmath>
#include<fstream>
#include<ctime>
#include<vector>
#include<stack>
#include <map>
#define bug cout << "**********" << endl
//#define LOCAL = 1;
using namespace std;
typedef long long ll;
const int inf = 0x3f3f3f3f;
const int mod = 1e8;
const int Max = 1e5 + 10;

int n, m;						        //n代表区间长度，也就是数据量; m 代表查询次数
int dist[Max];					        //记录数据
int Log[Max];					        //Log[i]向下取整
int max_dis[Max][20], min_dis[Max][20];	//max_dis[i][j]记录区间	[i,i + (1<<j)-1] 的最大值

void RMQ()
{
	Log[0] = -1;
	for (int i = 1; i <= n; i++)		//求Log[i]向下取整，倍增
		Log[i] = Log[i >> 1] + 1;

	for (int i = 1;i <= n; i++)
	{
		max_dis[i][0] = dist[i];
		min_dis[i][0] = dist[i];		//初始化，长度为1的区间的最值
	}
	for (int j = 1;j <= Log[n]; j++)	//从小区间开始向大区间枚举，依次枚举长度为 2^j 的区间
	{
		for (int i = 1; i <= n; i++)	//枚举起点
		{
			if (i + (1 << j) - 1 <= n)	//判断合法性，不能够越界
			{
				max_dis[i][j] = max(max_dis[i][j - 1], max_dis[i + (1 << (j - 1))][j - 1]);
				min_dis[i][j] = min(min_dis[i][j - 1], min_dis[i + (1 << (j - 1))][j - 1]);
				//求[i,i+(1<<j)-1]区间的最值等于求其子区间 [i,i+(1<<(j-1))-1] 和 [i+(1<<(j-1)),i+(1<<j)-1]中最值的最值（有点绕，就是最值的意思）
				//有点动态规划的味道，根据子区间最优解得到区间的最优解
			}
		}
	}
}


int getMax(int l, int r)
{
	int x = Log[r - l + 1];		//折半查找的区间长度
	return max(max_dis[l][x], max_dis[r - (1 << x) + 1][x]);
}

int getMin(int l, int r)
{
	int x = Log[r - l + 1];		//折半查找的区间长度
	return min(min_dis[l][x], min_dis[r - (1 << x) + 1][x]);
}

int main()
{
#ifdef LOCAL
	freopen("input.txt", "r", stdin);
	freopen("output.txt", "w", stdout);
#endif
	scanf("%d%d", &n,&m);
	for (int i = 1;i <= n; i++)
	{
		scanf("%d", dist + i);
	}
	RMQ();
	while (m--)
	{
		int r, l;
		scanf("%d%d", &l, &r);
		printf("%d\n", getMax(l, r)- getMin(l, r));
	}
	return 0;
}

winer_bamboo

关注

0
点赞
踩
0

收藏

觉得还不错? 一键收藏
0
评论
RMQ（一维+二维）附例题 POJ 3264，POJ 2019

代码功能众所周之，求区间最值对于ACMer来说，是必须掌握的，为此我将之贴一下，注解也比较详细，方便查阅。这段代码能够求一段连续的数在任意区间的最值。代码区（一维+详细说明）#include<iostream>#include<cstdio>#include<algorithm>#include<cstring>#inclu...
复制链接

扫一扫