【题解】CF547B：Mike and Feet

原题传送门
求出每个点向左延伸到$l_i$，向右延伸到$r_i$
表示$a_i$是$a_{l_i}到a_{r_i}$最小的
对于$an{s}_{r_i-l_i+1}=max(an{s}_{r_i-l_i+1},a_i)$
$an{s}_i=max(an{s}_i,an{s}_{i+1})$

$l_i,r_i$用单调栈处理

Code：

#include <bits/stdc++.h>
#define maxn 200010
using namespace std;
int n, a[maxn], l[maxn], r[maxn], stk[maxn], ans[maxn];

inline int read(){
	int s = 0, w = 1;
	char c = getchar();
	for (; !isdigit(c); c = getchar()) if (c == '-') w = -1;
	for (; isdigit(c); c = getchar()) s = (s << 1) + (s << 3) + (c ^ 48);
	return s * w;
}

int main(){
	n = read();
	for (int i = 1; i <= n; ++i) a[i] = read();
	int top = 0;
	for (int i = 1; i <= n; ++i){
		while (top && a[stk[top]] > a[i]) r[stk[top--]] = i - 1;
		stk[++top] = i;
	}
	while (top) r[stk[top--]] = n;
	for (int i = n; i; --i){
		while (top && a[stk[top]] > a[i]) l[stk[top--]] = i + 1;
		stk[++top] = i;
	}
	while (top) l[stk[top--]] = 1;
	for (int i = 1; i <= n; ++i) ans[r[i] - l[i] + 1] = max(ans[r[i] - l[i] + 1], a[i]);
	for (int i = n - 1; i; --i) ans[i] = max(ans[i], ans[i + 1]);
	for (int i = 1; i <= n; ++i) printf("%d ", ans[i]);
	return 0;
}