【BZOJ3675】[Apio2014]序列分割【斜率优化】
2016-02-29 20:26
218 查看
写了各种姿势,最后还是得照着网上题解才能AC= =
参考了凯爷blog:http://blog.csdn.net/lethelody/article/details/44781927
#include <cstdio>
#include <algorithm>
using namespace std;
typedef long long LL;
const int maxn = 100005, maxq = maxn;
int n, k, q[maxq];
LL f[maxn][2], sum[maxn];
inline int iread() {
int f = 1, x = 0; char ch = getchar();
for(; ch < '0' || ch > '9'; ch = getchar()) f = ch == '-' ? -1 : 1;
for(; ch >= '0' && ch <= '9'; ch = getchar()) x = x * 10 + ch - '0';
return f * x;
}
inline LL y(int a, int b, int t) {
return (f[a][t] - sum[a] * sum[a]) - (f[b][t] - sum[b] * sum[b]);
}
inline LL x(int a, int b) {
return sum[a] - sum[b];
}
int main() {
n = iread(); k = iread();
for(int i = 1; i <= n; i++) sum[i] = iread() + sum[i - 1];
for(int j = 1; j <= k; j++) {
int h = 1, t = 1; q[h] = j;
for(int i = j + 1; i <= n; i++) {
for(; h < t && y(q[h + 1], q[h], ~j & 1) >= -sum[i] * x(q[h + 1], q[h]); h++);
f[i][j & 1] = f[q[h]][~j & 1] + sum[q[h]] * (sum[i] - sum[q[h]]);
for(; h < t && y(q[t], q[t - 1], ~j & 1) * x(i, q[t]) <= y(i, q[t], ~j & 1) * x(q[t], q[t - 1]); t--);
q[++t] = i;
}
}
printf("%lld\n", f
[k & 1]);
return 0;
}
参考了凯爷blog:http://blog.csdn.net/lethelody/article/details/44781927
#include <cstdio>
#include <algorithm>
using namespace std;
typedef long long LL;
const int maxn = 100005, maxq = maxn;
int n, k, q[maxq];
LL f[maxn][2], sum[maxn];
inline int iread() {
int f = 1, x = 0; char ch = getchar();
for(; ch < '0' || ch > '9'; ch = getchar()) f = ch == '-' ? -1 : 1;
for(; ch >= '0' && ch <= '9'; ch = getchar()) x = x * 10 + ch - '0';
return f * x;
}
inline LL y(int a, int b, int t) {
return (f[a][t] - sum[a] * sum[a]) - (f[b][t] - sum[b] * sum[b]);
}
inline LL x(int a, int b) {
return sum[a] - sum[b];
}
int main() {
n = iread(); k = iread();
for(int i = 1; i <= n; i++) sum[i] = iread() + sum[i - 1];
for(int j = 1; j <= k; j++) {
int h = 1, t = 1; q[h] = j;
for(int i = j + 1; i <= n; i++) {
for(; h < t && y(q[h + 1], q[h], ~j & 1) >= -sum[i] * x(q[h + 1], q[h]); h++);
f[i][j & 1] = f[q[h]][~j & 1] + sum[q[h]] * (sum[i] - sum[q[h]]);
for(; h < t && y(q[t], q[t - 1], ~j & 1) * x(i, q[t]) <= y(i, q[t], ~j & 1) * x(q[t], q[t - 1]); t--);
q[++t] = i;
}
}
printf("%lld\n", f
[k & 1]);
return 0;
}
相关文章推荐
- [BZOJ1096][ZJOI2007][DP][斜率优化]仓库建设
- [BZOJ1492][NOI2007][斜率优化][动态凸包][DP][分治]货币兑换cash
- HDU 3045
- 【bzoj1010】【斜率优化】【HNOI2008】玩具装箱toy
- (解题报告) Uva 1616 Caravan Robbers (商队抢劫者)(上凸包+队列+结构体)
- [BZOJ1010][HNOI2008]玩具装箱toy(斜率优化)
- hdu 3507 斜率优化dp入门
- 2015湖南省队集训DAY4——hoodle
- DP:斜率优化 Slope optimization
- 【BZOJ 2149】 拆迁队
- 斜率优化DP 【pascal】
- 1010: [HNOI2008]玩具装箱toy
- 斜率优化专题1——bzoj 1597 [Usaco2008 Mar] 土地购买 题解
- 斜率优化专题2——bzoj 1010 [HNOI2008]玩具装箱toy 题解
- 斜率优化专题3——bzoj 3156 防御准备 题解
- 斜率优化专题4——bzoj 1911: [Apio2010] 特别行动队 题解
- 斜率优化专题5——bzoj 1096 [ZJOI2007]仓库建设 题解
- BZOJ 1010: [HNOI2008]玩具装箱toy
- 2015.08.10总结
- 1D1D动规优化初步