1 #define wwx AK_IOI
 2
 3 #include <cstdio>
 4 #include <algorithm>
 5
 6 const int N = 1010, INF = 0x7f7f7f7f, M = 10010;
 7
 8 struct Custom {
 9     int t, A, B;
10 }a[M];
11
12 int n, m, k, dis[N], limit[N], to[N], now[N], up[N], down[N], sum[N], influ[N], to_lar[N];
13
14 int main() {
15     scanf("%d%d%d", &n, &m, &k);
16     for(int i = 1; i < n; i++) {
17         scanf("%d", &dis[i]);
18     }
19     for(int i = 1; i <= m; i++) {
20         scanf("%d%d%d", &a[i].t, &a[i].A, &a[i].B);
21         limit[a[i].A] = std::max(limit[a[i].A], a[i].t);
22         up[a[i].A]++;
23         down[a[i].B]++;
24     }
25     sum[1] = down[1];
26     for(int i = 2; i <= n; i++) {
27         limit[i] = std::max(limit[i], limit[i - 1]);
28         sum[i] = sum[i - 1] + down[i];
29     }
30     // get limit sum up down
31
32     while(k) {
33         now[1] = 0;
34         for(int i = 2; i <= n; i++) {
35             now[i] = std::max(now[i - 1], limit[i - 1]) + dis[i - 1];
36         }
37         int large = -1, pos = -1;
38         to[n] = n - 1;
39         to_lar[n] = INF;
40         for(int i = n - 1; i >= 1; i--) {
41             if(now[i + 1] > limit[i + 1]) {
42                 to[i] = to[i + 1];
43                 to_lar[i] = std::min(to_lar[i + 1], now[i + 1] - limit[i + 1]);
44                 //to_lar[i] = std::min(to_lar[i], dis[i]);  <- ERROR
45             }
46             else {
47                 to[i] = i;
48                 to_lar[i] = INF;
49             }
50             influ[i] = sum[to[i] + 1] - sum[i];
51             //printf("influ : %d  %d  \n", i, influ[i]);
52             if(influ[i] > large && to_lar[i] && dis[i]) {
53                 large = influ[i];
54                 pos = i;
55             }
56         }
57         if(to_lar[pos] == 0) {
58             break;
59         }
60         to_lar[pos] = std::min(to_lar[pos], dis[pos]);
61         dis[pos] -= std::min(to_lar[pos], k);
62         k -= std::min(to_lar[pos], k);
63         //printf("pos = %d  to[] = %d  lar = %d \n", pos, to[pos], to_lar[pos]);
64     }
65
66     now[1] = 0;
67     for(int i = 2; i <= n; i++) {
68         now[i] = std::max(now[i - 1], limit[i - 1]) + dis[i - 1];
69     }
70
71     int ans = 0;
72     for(int i = 1; i <= m; i++) {
73         ans += now[a[i].B] - a[i].t;
74     }
75
76     printf("%d", ans);
77     return 0;
78 }