1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
| #include <iostream>
#include <vector>
#include <string>
#include <cstring>
#include <algorithm>
#include <sstream>
#include <map>
#include <set>
#define REP(i,k,n) for(int i=k;i<n;i++)
#define rep(i,n) for(int i=0;i<n;i++)
#define INF 1<<30
#define pb push_back
#define mp make_pair
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
int main() {
int d, n;
cin >> d >> n;
vector<int> t(d);
rep(i, d) cin >> t[i];
vector<int> a(n), b(n), c(n);
rep(i, n) cin >> a[i] >> b[i] >> c[i];
int dp[205][205];
rep(i, 205) rep(j, 205) dp[i][j] = -1;
rep(i, n) {
if(a[i] <= t[0] && t[0] <= b[i]) dp[0][i] = 0;
}
REP(i, 1, d) {
rep(j, n) {
if(a[j] <= t[i] && t[i] <= b[j]) {
rep(k, n) {
if(dp[i-1][k] == -1) continue;
dp[i][j] = max(dp[i][j], dp[i-1][k] + abs(c[k] - c[j]));
}
}
}
}
int ans = 0;
rep(i, n) {
ans = max(ans, dp[d-1][i]);
}
cout << ans << endl;
return 0;
}
|