题目链接: http://codeforces.com/problemset/problem/321/E
题意: 有n个人要上k条船, 只能一段连续的区间分配到一条船上, 每条船上不能空, 如果i, j在同一条船上将产生 ai,j 的不满意度, 最小化不满意度之和。( n≤4000,k≤min(n,800) )
思路: f[i][j]表示前i条船上装了前j个人, 通过打表可以观察得是满足决策单调性得, 考虑二分栈优化。 维护每个最优决策的区间, 每次新加入一个决策, 和栈顶元素“争夺”区间, 这个可以二分获得, 如果栈顶元素的区间被抢光了, 则退栈考虑下一个。 最后扫一遍依次算答案。
时间复杂度:O(nklogn)
空间复杂度:O(nk)
PS:好像不打读入优化还不好过
#include <queue>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#define pi pair<int, int >
#define mk(i, j) make_pair(i, j)
#define fi first
#define se second
using namespace std;
const int N = 4010;
const int M = 810;
int n, m, f[M][N], w[N][N];
pi stk[N]; int top, inf;
int getint(){
int ret = 0;
char c = getchar();
while (c < '0' || c > '9') c = getchar();
while (c >= '0' && c <= '9'){
ret = ret * 10 + c - '0';
c = getchar();
}
return ret;
}
int get(int i, int j, int k){
if (j < i) return inf;
if (f[i - 1][k] == inf) return inf;
if (j <= k) return inf;
return f[i - 1][k] + w[j][j] - w[j][k] - w[k][j] + w[k][k];
}
int main(){
n = getint(); m = getint();
for (int i = 1; i <= n; i ++)
for (int j = 1; j <= n; j ++){
int x = getint();
w[i][j] = w[i - 1][j] + w[i][j - 1] - w[i - 1][j - 1] + x;
}
memset(f, 67, sizeof(f)); f[0][0] = 0; inf = f[0][1];
for (int i = 1; i <= m; i ++){
stk[top = 1] = mk(0, i);
for (int j = 1; j <= n; j ++){
while (top && get(i, stk[top].se, stk[top].fi) >= get(i, stk[top].se, j)) top --;
if (top){
int l = stk[top].se + 1, r = n, pos = -1;
while (l <= r){
int mid = (l + r) >> 1;
if (get(i, mid, stk[top].fi) >= get(i, mid, j)) pos = mid, r = mid - 1;
else l = mid + 1;
}
if (pos != -1) stk[++ top] = mk(j, pos);
}
else stk[++ top] = mk(j, i);
}
stk[top + 1] = mk(0, n + 1);
for (int j = 1; j <= top; j ++)
for (int k = stk[j].se; k < stk[j + 1].se; k ++)
f[i][k] = get(i, k, stk[j].fi);
}
printf("%d\n", f[m][n] / 2);
return 0;
}