P3648 [APIO2014] 序列分割

#include <bits/stdc++.h>
using namespace std;
typedef long long LL;

const int N = 1e5 + 10;

int n, k, fa[205][N];
LL s[N], f[N], g[N];

double slope(int a, int b) {
	LL x1 = - s[a], y1 = g[a] - s[a] * s[a];
	LL x2 = - s[b], y2 = g[b] - s[b] * s[b];
	if(x1 == x2) return -1e18;
	return (y2 - y1) / (double) (x2 - x1);
}

int main() {
	scanf("%d%d", &n, &k);
	for(int i = 1; i <= n; i ++) {
		scanf("%lld", s + i);
		s[i] += s[i - 1];
	}
	static int q[N], hd, bk;
	for(int t = 1; t <= k; t ++) {
		for(int i = 1; i <= n; i ++) g[i] = f[i]; 
		hd = bk = 0;
		for(int i = 1; i <= n; i ++) {
			for(; bk - hd >= 2 && slope(q[hd], q[hd + 1]) <= s[i]; hd ++) ;
			f[i] = 0;
			if(hd < bk) {
				int & j = q[hd]; fa[t][i] = j;
				f[i] = g[j] + s[j] * (s[i] - s[j]);
			}
			for(; bk - hd >= 2 && slope(q[bk - 1], q[bk - 2]) >= slope(i, q[bk - 1]); bk --) ;
			q[bk ++] = i;
		}
	}
	printf("%lld\n", f[n]);
	for(int x = fa[k][n]; k; x = fa[-- k][x])
		printf("%d ", x);
}