Look Up S -CSDN博客

本文链接：https://blog.csdn.net/lhk18850963086/article/details/145503196

题目总结：
要求找到一个数列里的每一个数后面的离他最近的大于他的数。

逆向思维：从最后一个开始判断，具体代码如下

#include<iostream>
using namespace std;
int n, high[100100], up[100100];
int read()
{
	int x = 0, f = 1;
	char c = getchar();
	while (c < '0' || c>'9') {
		if (c == '-') f = -1;
		c = getchar();
	}
	while (c >= '0' && c <= '9') {
		x = x * 10 + c - '0';
		c = getchar();
	}
	return x * f;
}
int main()
{
	int tol;
	n = read();
	for (int i = 0;i < n;i++)high[i] = read();
	up[n - 1] = -1;
	for (int i = n - 2;i >= 0;i--) {
		if (high[i] < high[i + 1])up[i] = i + 1;
		else {
			tol = i+1;
			while (true) {
				if (high[i] < high[up[tol]]) {
					up[i] = up[tol];
					break;
				}
				if (up[tol] == -1) {
					up[i] = -1;
					break;
				}
				tol = up[tol];
			}
		}
	}
	for (int i = 0;i < n;i++)printf("%d\n", up[i] + 1);
	return 0;
}

也有一个递归的版本，运行没有任何问题，题目的示例也过了，但是提交时会遇到Runtime Error，不知道是为什么，放在这里共各位大佬们看看能不能看出是为啥。

#include<iostream>
using namespace std;
int n, high[100100], up[100100];
int read()
{
	int x = 0, f = 1;
	char c = getchar();
	while (c < '0' || c>'9') {
		if (c == '-') f = -1;
		c = getchar();
	}
	while (c >= '0' && c <= '9') {
		x = x * 10 + c - '0';
		c = getchar();
	}
	return x * f;
}
int look_further(int i, int n)
{
	if (i == -1)return -1;
	if (n < high[up[i]])return up[i];
	else look_further(up[i], n);
}
int main()
{
	int tol;
	n = read();
	for (int i = 0;i < n;i++)high[i] = read();
	up[n - 1] = -1;
	for (int i = n - 2;i >= 0;i--) {
		if (high[i] < high[i + 1])up[i] = i + 1;
		else up[i] = look_further(i + 1, high[i]);
	}
	for (int i = 0;i < n;i++)printf("%d\n", up[i] + 1);
	return 0;
}

学习心得：熟悉了各个数组的索引，学会用逆向思维解决问题。