[USACO09FEB]庙会班车Fair Shuttle 线段树维护maxx&&贪心

题目描述

Although Farmer John has no problems walking around the fair to collect prizes or see the shows, his cows are not in such good shape; a full day of walking around the fair leaves them exhausted. To help them enjoy the fair, FJ has arranged for a shuttle truck to take the cows from place to place in the fairgrounds.

FJ couldn't afford a really great shuttle, so the shuttle he rented traverses its route only once (!) and makes N (1 <= N <= 20,000) stops (conveniently numbered 1..N) along its path. A total of K (1 <= K <= 50,000) groups of cows conveniently numbered 1..K wish to use the shuttle, each of the M_i (1 <= M_i <= N) cows in group i wanting to ride from one stop S_i (1 <= S_i < E_i) to another stop E_i (S_i < E_i <= N) farther along the route.

The shuttle might not be able to pick up an entire group of cows (since it has limited capacity) but can pick up partial groups as appropriate.

Given the capacity C (1 <= C <= 100) of the shuttle truck and the descriptions of the groups of cows that want to visit various sites at the fair, determine the maximum number of cows that can ride the shuttle during the fair.

逛逛集市，兑兑奖品，看看节目对农夫约翰来说不算什么，可是他的奶牛们非常缺乏锻炼——如果要逛完一整天的集市，他们一定会筋疲力尽的。所以为了让奶牛们也能愉快地逛集市，约翰准备让奶牛们在集市上以车代步。但是，约翰木有钱，他租来的班车只能在集市上沿直线跑一次，而且只能停靠N(1 ≤N≤20000)个地点（所有地点都以1到N之间的一个数字来表示）。现在奶牛们分成K(1≤K≤50000)个小组，第i 组有Mi(1 ≤Mi≤N)头奶牛，他们希望从Si跑到Ti(1 ≤Si<Ti≤N)。

由于班车容量有限，可能载不下所有想乘车的奶牛们，此时也允许小里的一部分奶牛分开乘坐班车。约翰经过调查得知班车的容量是C(1≤C≤100)，请你帮助约翰计划一个尽可能满足更多奶牛愿望的方案。

输入输出格式

输入格式：

【输入】

第一行：包括三个整数：K，N和C，彼此用空格隔开。

第二行到K+1行：在第i+1行，将会告诉你第i组奶牛的信息：Si，Ei和Mi，彼

此用空格隔开。

输出格式：

【输出】

第一行：可以坐班车的奶牛的最大头数。

输入输出样例

输入样例#1：
复制

8 15 3
1 5 2
13 14 1
5 8 3
8 14 2
14 15 1
9 12 1
12 15 2
4 6 1

输出样例#1： 复制

10

说明

【样例说明】

班车可以把2头奶牛从1送到5，3头奶牛从5送到8，2头奶牛从8送到14，1头

奶牛从9送到12，1头奶牛从13送到14，1头奶牛从14送到15。

贪心按照右端点排序；

然后线段树维护区间最大值；

#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstdlib>
#include<cstring>
#include<string>
#include<cmath>
#include<map>
#include<set>
#include<vector>
#include<queue>
#include<bitset>
#include<ctime>
#include<deque>
#include<stack>
#include<functional>
#include<sstream>
//#include<cctype>
//#pragma GCC optimize(2)
using namespace std;
#define maxn 900005
#define inf 0x7fffffff
//#define INF 1e18
#define rdint(x) scanf("%d",&x)
#define rdllt(x) scanf("%lld",&x)
#define rdult(x) scanf("%lu",&x)
#define rdlf(x) scanf("%lf",&x)
#define rdstr(x) scanf("%s",x)
typedef long long  ll;
typedef unsigned long long ull;
typedef unsigned int U;
#define ms(x) memset((x),0,sizeof(x))
const long long int mod = 1e9 + 7;
#define Mod 1000000000
#define sq(x) (x)*(x)
#define eps 1e-3
typedef pair<int, int> pii;
#define pi acos(-1.0)
//const int N = 1005;
#define REP(i,n) for(int i=0;i<(n);i++)
typedef pair<int, int> pii;
inline ll rd() {
	ll x = 0;
	char c = getchar();
	bool f = false;
	while (!isdigit(c)) {
		if (c == '-') f = true;
		c = getchar();
	}
	while (isdigit(c)) {
		x = (x << 1) + (x << 3) + (c ^ 48);
		c = getchar();
	}
	return f ? -x : x;
}

ll gcd(ll a, ll b) {
	return b == 0 ? a : gcd(b, a%b);
}
int sqr(int x) { return x * x; }

/*ll ans;
ll exgcd(ll a, ll b, ll &x, ll &y) {
	if (!b) {
		x = 1; y = 0; return a;
	}
	ans = exgcd(b, a%b, x, y);
	ll t = x; x = y; y = t - a / b * y;
	return ans;
}
*/
struct node {
	int l, r;
	int maxx;
	int lazy;
}tree[maxn];
int n, m, k;
struct Nd {
	int lft, rgt, val;
}qu[maxn];
bool cmp(Nd a, Nd b) {
	if (a.rgt != b.rgt)return a.rgt < b.rgt;
	return a.lft < b.lft;
}
void pushup(int rt) {
	tree[rt].maxx = max(tree[rt << 1].maxx, tree[rt << 1 | 1].maxx);
}
void pushdown(int rt) {
	if (tree[rt].lazy) {
		tree[rt << 1].lazy += tree[rt].lazy;
		tree[rt << 1 | 1].lazy += tree[rt].lazy;
		tree[rt << 1].maxx += tree[rt].lazy;
		tree[rt << 1 | 1].maxx += tree[rt].lazy;
		tree[rt].lazy = 0;
	}
}
void upd(int L, int R, int l, int r, int rt,int val) {
	if (L <= l && r <= R) {
		tree[rt].lazy += val; tree[rt].maxx += val;
		return;
	}
	pushdown(rt);
	int mid = (l + r) >> 1;
	if (L <= mid)upd(L, R, l, mid, rt << 1, val);
	if (mid < R)upd(L, R, mid + 1, r, rt << 1 | 1, val);
	pushup(rt);
}
int query(int L, int R, int l, int r, int rt) {
	if (L <= l && r <= R)return tree[rt].maxx;
	pushdown(rt);
	int mid = (l + r) >> 1;
	int ans = -inf;
	if (L <= mid)ans = max(ans, query(L, R, l, mid, rt << 1));
	if (mid < R)ans = max(ans, query(L, R, mid + 1, r, rt << 1 | 1));
	return ans;
}

int main() {
	//ios::sync_with_stdio(0);
	rdint(k); rdint(n); rdint(m);
	for (int i = 1; i <= k; i++) {
		rdint(qu[i].lft); rdint(qu[i].rgt);
		rdint(qu[i].val);
	}
	sort(qu + 1, qu + 1 + k, cmp);
	int res = 0;
	for (int i = 1; i <= k; i++) {
		int tmp = query(qu[i].lft, qu[i].rgt-1, 1, n, 1);
		int minn = min(m - tmp, qu[i].val);
		res += minn;
		upd(qu[i].lft, qu[i].rgt-1, 1, n, 1, minn);
	}
	cout << res << endl;
	return 0;
}