Watching Fireworks is Fun

题面翻译

一个城镇有$n$个区域,从左到右$1$编号为$n$,每个区域之间距离$1$个单位距离。 节日中有$m$个烟火要放，给定放的地点$a_i$,时间$t_i$,如果你当时在区域$x$,那么你可以获得$b_i - \vert a_i - x\vert$的开心值。 你每个单位时间可以移动不超过$d$个单位距离。 你的初始位置是任意的(初始时刻为$1$),求你通过移动能获取到的最大的开心值。

题目描述

A festival will be held in a town's main street. There are $n$ sections in the main street. The sections are numbered $1$ through $n$ from left to right. The distance between each adjacent sections is $1$ .

In the festival $m$ fireworks will be launched. The $i$ -th ( $1<=i<=m$ ) launching is on time $t_{i}$ at section $a_{i}$ . If you are at section $x$ ( $1<=x<=n$ ) at the time of $i$ -th launching, you'll gain happiness value $b_{i}-|a_{i}-x|$ (note that the happiness value might be a negative value).

You can move up to $d$ length units in a unit time interval, but it's prohibited to go out of the main street. Also you can be in an arbitrary section at initial time moment (time equals to $1$ ), and want to maximize the sum of happiness that can be gained from watching fireworks. Find the maximum total happiness.

Note that two or more fireworks can be launched at the same time.

输入格式

The first line contains three integers $n$ , $m$ , $d$ ( $1<=n<=150000; 1<=m<=300; 1<=d<=n$ ).

Each of the next $m$ lines contains integers $a_{i}$ , $b_{i}$ , $t_{i}$ ( $1<=a_{i}<=n; 1<=b_{i}<=10^{9}; 1<=t_{i}<=10^{9}$ ). The $i$ -th line contains description of the $i$ -th launching.

It is guaranteed that the condition $t_{i}<=t_{i+1}$ ( 1<=i&lt;m ) will be satisfied.

输出格式

Print a single integer — the maximum sum of happiness that you can gain from watching all the fireworks.

Please, do not write the %lld specifier to read or write 64-bit integers in C++. It is preferred to use the cin, cout streams or the %I64d specifier.

样例 #1

样例输入 #1

50 3 1
49 1 1
26 1 4
6 1 10

样例输出 #1

-31

样例 #2

样例输入 #2

10 2 1
1 1000 4
9 1000 4

样例输出 #2

1992