计量大学 H Happy Time is Always Short

最新推荐文章于 2020-09-28 18:41:28 发布

江心之人

最新推荐文章于 2020-09-28 18:41:28 发布

阅读量349

点赞数

分类专栏：算法文章标签：程序设计

本文链接：https://blog.csdn.net/qq_44754132/article/details/108842540

版权

算法专栏收录该内容

54 篇文章 1 订阅

订阅专栏

H Happy Time is Always Short

The happy time is always short. The party comes to an end, and the security guard $G Y Q$ can finally rest for a while. He was so miserable in the beginning that he didn't have the energy to complete the final task seriously.

Everyone at the party has a strength value expressed as $nb_i$ . They will leave in a specific order. $G Y Q$ 's original task is to count the maximum strength of the remaining people in all the different intervals, but he does not have the energy to calculate it carefully, so he can only submit a report to the senior management $Z X$ to represent the departure of a particular group of people. As for the maximum value, $Z X$ can only calculate by himself in order to provide different levels of service, which is going to drive him crazy. Please Help him!

Given a report submitted by $G Y Q$ , there are two integers $N$ and $M$ , representing that there were $N$ people at the beginning and $M$ leaving records. After that, given an $n b$ array of $N$ numbers, representing each person's strength value. Then followed $M$ lines, each line has two numbers $l$ and $r$ , representing all the people whose number $i$ is in this range ( $l$ ≤ $i$ ≤ $r$ ) had left. Of course, each person will leave only once and will not return, but due to $G Y Q$ 's carelessness, the record may be overlap. You need to tell $Z X$ the maximum strength of all the remaining people after each recording. If nobody is here, the answer is $0$ .

Input Specification:

There are multiple test cases. The first line of input contains an integer $T$ ( $1$ ≤ $T$ ≤ $10$ ), indicating the number of test cases. For each test case:

The first line contains two integers $N$ , $M$ ( $1$ ≤ $N$ , $M$ ≤ $10^5$ ), indicating the number of plates.

The second line contains $N$ integers, $nb_1$ , $nb_2$ ,……, $nb_n$ ( $1$ ≤ $nb_i$ ≤ $10^9$ ), indicating the strength value of person numbered $i$ .

Then, in the following next $M$ lines, each line contains two integers $l_j$ , $r_j$ ( $1$ ≤ $l_j$ ≤ $r_j$ ≤ $N$ ), indicating the $j$ -th range.

Note: This problem has huge input data; it's recommended to use scanf instead of cin to read data in order to avoid time limit exceed.

Output Specification:

For each test case, print $M$ lines, each line contains an integer, indicating the maximum strength value of people who still stay here.

Sample Input:

Sample Output:

5
2
2

题目大意

欢乐的时光总是短暂的。大家在一起的聚会也总有结束的时刻吧。
现在会场里有 $N$ 个人，然后每次都需要置定一个区间 $[L, R]$ ，令这些人离开，每个人都有一个权重，需要在人们每次离开之后都输出当前存在的所有人权重最大的数值。

简析

线段树维护区间最大值乱搞。模板题。

参考代码

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 1e5 + 10;

int a[N];
int n;

struct Node
{
	int l, r;
	//区间最大值
	int mx;
	int lazy;
}tr[N * 4];

void pushup(int u)
{
	tr[u].mx = max(tr[u << 1].mx, tr[u << 1 | 1].mx);
}

void pushdown(int u)
{
	if (tr[u].lazy)
	{
		tr[u].lazy = 0;
		tr[u << 1].mx = 0;
		tr[u << 1 | 1].mx = 0;
		tr[u << 1].lazy = tr[u << 1 | 1].lazy = 1;
	}
}

void build(int u, int l, int r)
{
	tr[u] = { l, r, 0, 0 };
	if (l == r)
	{
		tr[u].mx = a[l];
		return;
	}
	int mid = l + r >> 1;
	build(u << 1, l, mid), build(u << 1 | 1, mid + 1, r);
	pushup(u);
}

int query(int u, int l, int r)
{
	if (l <= tr[u].l && r >= tr[u].r)
		return tr[u].mx;
	pushdown(u);
	int mid = tr[u].l + tr[u].r >> 1;
	int res = 0;
	if (l <= mid) res = max(res, query(u << 1, l, r));
	if (r > mid) res = max(res, query(u << 1 | 1, l, r));
	return res;
}

void modify(int u, int l, int r)
{
	if (l <= tr[u].l && r >= tr[u].r)
	{
		tr[u].lazy = 1;
		tr[u].mx = 0;
		return;
	}
	pushdown(u);
	int mid = tr[u].l + tr[u].r >> 1;
	if (l <= mid) modify(u << 1, l, r);
	if (r > mid) modify(u << 1 | 1, l, r);
	pushup(u);
}

int main() {
	// freopen("in.txt", "r", stdin);
	int t;
	scanf("%d", &t);
	while (t--) {
		int m;
		scanf("%d%d", &n, &m);
		for (int i = 1; i <= n; i++) scanf("%d", a + i);
		build(1, 1, n);
		while (m--) {
			int l, r;
			scanf("%d%d", &l, &r);
			modify(1, l, r);
			int ans = query(1, 1, n);
			printf("%d\n", ans);
		}
	}
	return 0;
}