LC线段树

LC线段树

O(nlog^2n)
支持：
①修改：在区间上覆盖一个等差数列（在平面上添加一条线段y=kx+b）
②查询：单点max（某点最上方的线段的函数值）

#include<bits/stdc++.h>
#define N 200010
#define lc k << 1
#define rc k << 1 | 1
#define inf 0x3f3f3f3f3f3f3f3fLL
using namespace std;
int a[N], L[N], R[N], sta[N];
typedef long long LL;

struct node
{
	int flag;
	LL k, b;
	node() { flag = 0; }
	node(int _flag, LL _k, LL _b) { flag = _flag, k = _k, b = _b; }
	LL calc(int x)
	{
		if(!flag) return -inf;
		return k * x + b;
	}
}seg[N << 2];

double isc(node a, node b)
{
	return (double)(b.b - a.b) / (a.k - b.k);
}

void updata(int k, int l, int r, node New)
{
	if(!seg[k].flag)
	{
		seg[k] = New;
		return;
	}
	
	if(seg[k].calc(l) < New.calc(l)) swap(seg[k], New); //保证seg的L更大减少分类讨论
														//不能反过来写，因为下面就return了 
	if(l == r) return; 
	
	double x = isc(seg[k], New);
	if(x < l || r < x) return;
	
	int mid = l + r >> 1;
	if(x <= mid)
	{
		updata(lc, l, mid, seg[k]);
		seg[k] = New;
	}
	else updata(rc, mid + 1, r, New);
}

void add(int k, int l, int r, int x, int y, node New)
{
	if(x <= l && r <= y)
	{
		updata(k, l, r, New);
		return;
	}
	int mid = l + r >> 1;
	if(x <= mid) add(lc, l, mid, x, y, New);
	if(mid < y)  add(rc, mid + 1, r, x, y, New);
}

LL query(int k, int l, int r, int x)
{
	LL res = seg[k].calc(x);
	if(l == r) return res;
	int mid = l + r >> 1;
	if(x <= mid) res = max(res, query(lc, l, mid, x));
	else 		 res = max(res, query(rc, mid + 1, r, x));
	return res;
} 

int main()
{
	int n, top = 0;
	scanf("%d", &n);
	for(int i=1; i<=n; ++i)
	{
		scanf("%d", &a[i]);
		while(top && a[i] <= a[sta[top]]) --top;
		L[i] = sta[top];
		sta[++top] = i;
	}
	sta[top = 1] = n + 1;
	for(int i=n; i; --i)
	{
		while(top && a[i] <= a[sta[top]]) --top;
		R[i] = sta[top];
		sta[++top] = i;
	}
	
	for(int i=1; i<=n; ++i)
		add(1, 1, n, L[i] + 1, R[i] - 1, node(1, a[i], (LL)(-a[i]) * L[i]));
	
	LL Max = 0; 
	for(int i=1; i<=n; ++i)
		printf("%lld\n", Max = max(Max, query(1, 1, n, i)));
}