C2 - Skyscrapers (hard version),Codeforces Round #622 (Div. 2),单调栈

C2 - Skyscrapers (hard version)

http://codeforces.com/contest/1313/problem/C2
思路：首先枚举最高楼，由题意可知最高楼的两边都是递减的，现假设最高楼的下标为1，算出最优方案，之后每次将最高楼的下标向右平移，假设当前平移到i，发现要使得最高楼的左边递减，则需要将i左边第一个比它小的位置到i都置为m[i]，右边同，这个用单点栈维护出来就好，至于区间置数我当时是用线段树维护，但发现这题可以用个前缀和维护就好

#include<bits/stdc++.h>
#define ll long long
#define MAXN 500005
using namespace std;
ll s[MAXN];
struct node
{
	int l,r;
	ll sum,tag;
	node(){tag = 0;}
}tree[MAXN << 2];
inline void build(int k,int l,int r)
{
	tree[k].l = l,tree[k].r = r,tree[k].tag = 0;
	if(l == r)
	{
		tree[k].sum = s[l];
		return;
	}
	long long mid = (l + r) >> 1;
	build(k<<1,l,mid);
	build(k<<1|1,mid+1,r);
	tree[k].sum = tree[k<<1].sum+tree[k<<1|1].sum;
}
void change(int k)
{
	if(tree[k].l != tree[k].r)
	{
		tree[k<<1].sum = (tree[k<<1].r-tree[k<<1].l+1) * tree[k].tag;
		tree[k<<1|1].sum = (tree[k<<1|1].r-tree[k<<1|1].l+1) * tree[k].tag;
		tree[k<<1].tag = tree[k].tag;
		tree[k<<1|1].tag = tree[k].tag;
	}
	tree[k].tag = 0;
}
inline ll query(int k,int l,int r)
{
	if(tree[k].tag)
		change(k);
	if(tree[k].l == l && tree[k].r == r)
		return tree[k].sum;
	int mid = (tree[k].l+tree[k].r)>>1;
	if(r <= mid)
		return query(k<<1,l,r);
	else if(l >= mid+1)
		return query(k<<1|1,l,r);
	else
		return query(k<<1,l,mid)+query(k<<1|1,mid+1,r);
}
inline void add(int k,int l,int r,ll x)
{
	if(tree[k].tag)
		change(k);
	if(tree[k].l == l && tree[k].r == r)
	{
		tree[k].tag = x;
		tree[k].sum = (r-l+1)*x;
		return;
	}
	int mid = (tree[k].l+tree[k].r)>>1;
	if(r <= mid)
		add(k<<1,l,r,x);
	else if(l >= mid+1)
		add(k<<1|1,l,r,x);
	else
		add(k<<1,l,mid,x),add(k<<1|1,mid+1,r,x);
	tree[k].sum = tree[k<<1].sum + tree[k<<1|1].sum;
}
int n,l[MAXN],r[MAXN],cnt;
ll m[MAXN],st[MAXN],v[MAXN],ans1[MAXN],ans2[MAXN],res[MAXN];
int main()
{
	while(~scanf("%d",&n))
	{
		for(int i = 1;i <= n;++i)
			scanf("%lld",&m[i]);
		cnt = 0,v[0] = 0,st[0] = 0;
		for(int i =1;i <= n;++i)
		{
			while(cnt && m[i] <= v[cnt]) --cnt;
			l[i] = st[cnt];
			st[++cnt] = i,v[cnt] = m[i];
		}
		cnt = 0,v[0] = 0,st[0] = n+1;
		for(int i =n;i >= 1;--i)
		{
			while(cnt && m[i] <= v[cnt]) --cnt;
			r[i] = st[cnt];
			st[++cnt] = i,v[cnt] = m[i];
		}
		ll tmp = m[1];
		s[1] = m[1];
		for(int i = 2;i <= n;++i)
			s[i] = tmp = min(tmp,m[i]);
		build(1,1,n);
		ans1[1] = 0;
		for(int i = 2;i <= n;++i)
		{
			add(1,l[i]+1,i,m[i]);
			ans1[i] = query(1,1,i-1);
		}
		tmp = s[n] = m[n];
		for(int i = n;i >= 1;--i)
			s[i] = tmp = min(tmp,m[i]);
		build(1,1,n);
		ans2[n] = 0;
		for(int i = n-1;i >= 1;--i)
		{
			add(1,i,r[i]-1,m[i]);
			ans2[i] = query(1,i+1,n);
		}
		ll ans = 0,id;
		for(int i = 1;i <= n;++i)
		{
			if(ans1[i] + ans2[i] + m[i] > ans)
			{
				ans = ans1[i] + ans2[i] + m[i];
				id = i;
			}
		}
		res[id] = m[id];
		tmp = m[id];
		for(int j = id-1;j >= 1;--j)
			tmp = res[j] = min(tmp,m[j]);
		tmp = m[id];
		for(int j = id+1;j <= n;++j)
			tmp = res[j] = min(tmp,m[j]);
		for(int i = 1;i <= n;++i)
			printf("%lld ",res[i]);
		printf("\n");
	}
	return 0;
}