Submission #1627496

---

Source Code Expand

//#define __USE_MINGW_ANSI_STDIO 0
#include <bits/stdc++.h>

using namespace std;
typedef long long ll;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<ll> VL;
typedef vector<VL> VVL;
typedef pair<int, int> PII;

#define FOR(i, a, n) for (ll i = (ll)a; i < (ll)n; ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(x) x.begin(), x.end()
#define IN(a, b, x) (a<=x&&x<b)
#define MP make_pair
#define PB push_back
const int INF = (1LL<<30);
const ll LLINF = (1LL<<60);
const double PI = 3.14159265359;
const double EPS = 1e-12;
const int MOD = 1000000007;
//#define int ll

template <typename T> T &chmin(T &a, const T &b) { return a = min(a, b); }
template <typename T> T &chmax(T &a, const T &b) { return a = max(a, b); }

int dx[] = {0, 1, 0, -1}, dy[] = {1, 0, -1, 0};

int l[100010], r[100010], s[100010], dp[100010];
signed main(void)
{
  int n, m;
  cin >> n >> m;
  int sum = 0;
  REP(i, n) cin >> l[i] >> r[i] >> s[i], sum += s[i];

  REP(i, n) {
    dp[l[i]-1] += s[i];
    dp[r[i]] -= s[i];
  }
  REP(i, m-1) dp[i+1] += dp[i];
  int mi = INF;
  REP(i, m) chmin(mi, dp[i]);

  cout << sum - mi << endl;

  return 0;
}

Submission Info

Judge Result