题目链接:https://www.luogu.org/problem/P2947
时间限制: 1.00s 内存限制: 125.00MB
题目描述
Farmer John’s N ( 1 ≤ N ≤ 100 , 000 ) N (1 \le N \le 100,000) N(1≤N≤100,000) cows, conveniently numbered 1 1 1… N N N, are once again standing in a row. Cow i i i has height H i ( 1 ≤ H i ≤ 1 , 000 , 000 ) H_i (1 \le H_i \le 1,000,000) Hi(1≤Hi≤1,000,000).
Each cow is looking to her left toward those with higher index numbers. We say that cow i i i ‘looks up’ to cow j j j if i < j i < j i<j and H i H_i Hi < H j H_j Hj. For each cow i i i, FJ would like to know the index of the first cow in line looked up to by cow i i i.
Note: about 50 % 50\% 50% of the test data will have N ≤ 1 , 000 N \le 1,000 N≤1,000.
约翰的 N ( 1 ≤ N ≤ 1 0 5 N(1≤N≤10^5 N(1≤N≤105)头奶牛站成一排,奶牛 i i i的身高 是 H i ( l ≤ H i ≤ 1 , 000 , 000 ) 是H_i(l≤H_i≤1,000,000) 是Hi(l≤Hi≤1,000,000).现在,每只奶牛都在向右看齐.对于奶牛 i i i,如果奶牛 j j j满足 i < j i<j i<j且 H i < H j H_i<H_j Hi<Hj,我们可以说奶牛 i i i可以仰望奶牛 j j j. 求出每只奶牛离她最近的仰望对象.
输入格式
- Line 1 1 1: A A A single integer: N N N
- Lines 2 2 2… N + 1 N+1 N+1: Line i + 1 i+1 i+1 contains the single integer: H i H_i Hi
第 1 1 1 行输入 N N N,之后每行输入一个身高 H i H_i Hi。
输出格式
- Lines 1 1 1… N N N: Line i i i contains a single integer representing the smallest index of a cow up to which cow i i i looks. If no such cow exists, print 0 0 0.
共 N N N行,按顺序每行输出一只奶牛的最近仰望对象,如果没有仰望对象,输出 0 0 0。
输入输出样例
输入 #1
6
3
2
6
1
1
2
输出 #1
3
3
0
6
6
0
说明/提示
FJ has six cows of heights 3, 2, 6, 1, 1, and Cows 1 and 2 both look up to cow 3; cows 4 and 5 both look up to cow 6; and cows 3 and 6 do not look up to any cow.
【输入说明】6 头奶牛的身高分别为 3, 2, 6, 1, 1, 2.
【输出说明】奶牛#1,#2 仰望奶牛#3,奶牛#4,#5 仰望奶牛#6,奶牛#3 和#6 没有仰望对象。
【数据规模】
对于 20 % 20\% 20%的数据: 1 ≤ N ≤ 10 1≤N≤10 1≤N≤10;
对于 50 % 50\% 50%的数据: 1 ≤ N ≤ 1 , 000 1≤N≤1,000 1≤N≤1,000;
对于 100 % 100\% 100%的数据: 1 ≤ N ≤ 100 , 000 ; 1 ≤ H i ≤ 1 , 000 , 000 1≤N≤100,000;1≤H_i≤1,000,000 1≤N≤100,000;1≤Hi≤1,000,000.
解题思路
题意: 求序列中每一个在其右边的第一个比它大的值,就是向右找寻第一个比他本身大的值,并且储存下来,没找到则得0。
思路: 被仰视的奶牛的身高一定是单调不递减的,于是我们就可以用一个单调栈来维护。
在枚举每个奶牛的时候,我们可以比较当前奶牛的升高与栈顶的奶牛的身高。
如果当前奶牛的身高>栈顶奶牛的身高,那么再见了,栈顶的奶牛,以后的任意一个奶牛都不会仰视你了,因为当前的奶牛一定是更优解;否则,压进栈里就好了。
Accepted Code:
/*
* @Author: lzyws739307453
* @Language: C++
*/
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 1e5 + 5;
int pre[MAXN], spt[MAXN];
int main() {
int n;
stack <int> S;
scanf("%d", &n);
memset(pre, -1, sizeof(pre));
for (int i = 0; i < n; i++)
scanf("%d", &spt[i]);
for (int i = n - 1; ~i; i--) {
while (!S.empty() && spt[i] >= spt[S.top()])
S.pop();
if (!S.empty())
pre[i] = S.top();
S.push(i);
}
for (int i = 0; i < n; i++)
printf("%d\n", pre[i] + 1);
return 0;
}