{"trustable":false,"sections":[{"title":"题目大意","value":{"format":"HTML","content":"N个点,M个区间,每个区间[L, R]的权值为w\n从区间中选出一个子集,使得任意两个区间间隔至少为R,求最大的区间权值和。"}},{"title":"输入格式","value":{"format":"HTML","content":"N M R\nL R W"}},{"title":"输出格式","value":{"format":"HTML","content":"\u003cdiv class\u003d\"ptx\" lang\u003d\"en-US\"\u003e\u003cp\u003e* Line 1: The maximum number of gallons of milk that Bessie can product in the \u003ci\u003eN\u003c/i\u003e hours\u003c/p\u003e\u003c/div\u003e"}},{"title":"样例输入","value":{"format":"HTML","content":"\u003cpre class\u003d\"sio\"\u003e12 4 2\n1 2 8\n10 12 19\n3 6 24\n7 10 31\u003c/pre\u003e"}},{"title":"样例输出","value":{"format":"HTML","content":"\u003cpre class\u003d\"sio\"\u003e43\u003c/pre\u003e"}}]}