题意:
有n头牛,分别愿意在[fr, to] 的时间间隔内打扫卫生,打扫收费val元。
然后FJ想要在[S. E]的时间段内,都有牛在打扫卫生。
问他的最小花费是多少。
解析:
状态转移方程:
dp[end_i] = min(dp[end_i], min(dp[start_i] ~ dp[end_i]) + salary_i)
然后min(dp[start_i] ~ dp[end_i])这个用线段树来维护。
学习了一种新的rmq的写法。
http://www.hankcs.com/program/algorithm/poj-3171-cleaning-shifts.html
代码:
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <cstring>
#include <cmath>
#include <stack>
#include <vector>
#include <queue>
#include <map>
#include <set>
#include <climits>
#include <cassert>
#define LL long long
#define Min(a,b) ((a)<(b)?(a):(b))
#define Max(a,b) ((a)>(b)?(a):(b))
#define lson lo, mi, rt << 1
#define rson mi + 1, hi, rt << 1 | 1
using namespace std;
const int maxn = 10000 + 10;
const int inf = 0x3f3f3f3f;
const double eps = 1e-8;
const double pi = acos(-1.0);
const double ee = exp(1.0);
struct RangeMinimumQuery
{
int size;
int dat[1 << 18];
void init(int n)
{
size = 1;
while (size < n)
{
size *= 2;
}
memset(dat, 0x3f, sizeof(int) * size * 2);
}
// set value[k] = a
void update(int k, int a)
{
k += size - 1;
dat[k] = a;
while (k > 0)
{
k = (k - 1) / 2;
dat[k] = min(dat[k * 2 + 1], dat[k * 2 + 2]);
}
}
// min of range[a,b)
int query(int a, int b, int k, int l, int r)
{
if (r <= a || b <= l)
return 0x3f3f3f3f;
if (a <= l && r <= b)
return dat[k];
return min(query(a, b, k * 2 + 1, l, (l + r) / 2), query(a, b, k * 2 + 2, (l + r) / 2, r));
}
// min of range[a,b)
int query(int a, int b)
{
return query(a, b, 0, 0, size);
}
// get value[k]
int get(int k)
{
return dat[k + size];
}
} rmq;
struct Cow
{
int st, ed;
int val;
const bool operator < (const Cow& b)const
{
return st < b.st;
}
} cow[maxn];
int main()
{
#ifdef LOCAL
freopen("in.txt", "r", stdin);
#endif // LOCAL
int n, m, e;
// while (~scanf("%d%d%d", &n, &m, &e))
// {
scanf("%d%d%d", &n, &m, &e);
e -= m;
for (int i = 0; i < n; i++)
{
scanf("%d%d%d", &cow[i].st, &cow[i].ed, &cow[i].val);
cow[i].st = Max(0, cow[i].st - m) + 1;
cow[i].ed = Max(0, cow[i].ed - m) + 1;
}
rmq.init(e + 1);
rmq.update(0, 0);
sort(cow, cow + n);
for (int i = 0; i < n; i++)
{
rmq.update(cow[i].ed, Min(rmq.get(cow[i].ed - 1), rmq.query(cow[i].st - 1, cow[i].ed + 1) + cow[i].val));
}
printf("%d\n", rmq.get(e) == inf ? -1 : rmq.get(e));
// }
return 0;
}