链接
题目描述
给出n个物品和m个人,定义总价值为所有物品的价值之和,每个人可以在区间[l,r]的范围内删掉若干个数,删掉一个数的代价为ki,最多可以承受c的代价,问最大总价值为多少
样例输入
5 5 10
10 -2 -5 7 -10
1 1 5
2 4 10
4 4 12
3 4 10
1 5 15
样例输出
5
思路
发现就是一个01背包,但是赋值代价的时候有点麻烦,因为n^2会爆,那我就用线段树去跑
f
j
=
f
j
−
w
i
+
v
i
f_{j} = f_{j-w_i}+v_i
fj=fj−wi+vi
代码
#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#define ll long long
using namespace std;
int we[100005], tr[800005], n, m, k, l, r, w;
ll b[100005], f[5005], ans = -1e9, sum;
void change(int x, int l, int r, int L, int R, int w)
{
if(l == r){
tr[x] = min(tr[x], w);
return;
}
int mid = (l + r) >> 1;
if(L <= mid) change(x * 2, l, mid, L, R, w);
if(mid < R) change(x * 2 + 1, mid + 1, r, L, R, w);
}//修改单点的代价
int ask(int x, int l, int r, int L, int R)
{
if(L <= l && r <= R) return tr[x];
int mid = (l + r) >> 1;
if(L <= mid) return ask(x * 2, l, mid, L, R);
if(mid < R) return ask(x * 2 + 1, mid + 1, r, L, R);
}//查询单点的代价
int main()
{
memset(tr, 0x3f, sizeof(tr));
scanf("%d%d%d", &n, &m ,&k);
for(int i = 1; i <= n; ++i)
scanf("%lld", &b[i]), sum += b[i];
for(int i = 0; i <= 500; ++i)
f[i] = sum;
for(int i = 1; i <= m; ++i)
{
scanf("%d%d%d", &l, &r, &w);
change(1, 1, n, l, r, w);
}
for(int i = 1; i <= n; ++i)
we[i] = ask(1, 1, n, i, i);
for(int i = 1; i <= n; ++i)
for(int j = k; j >= 0; --j)
if(j - we[i] >= 0)
f[j] = max(f[j], f[j - we[i]] - b[i]);//01背包
for(int i = 0; i <= k; ++i)
ans = max(ans, f[i]);
printf("%lld", ans);
return 0;
}