bzoj1537

#include<bits/stdc++.h>
using namespace std;
const int N = 200010;
int dp[N], tree[N];
struct data {
    int x, y, p;
    inline bool friend operator < (data A, data B)
    {
        return A.x == B.x ? A.y < B.y : A.x < B.x;
    }
} a[N];
int n, m, k, ans;
inline int lowbit(int i)
{
    return i & (-i);
}
inline void update(int pos, int delta)
{
    for(int i = pos; i <= m; i += lowbit(i)) tree[i] = max(tree[i], delta);
}
inline int query(int pos)
{
    int ret = 0;
    for(int i = pos; i; i -= lowbit(i)) ret = max(ret, tree[i]);
    return ret;
} 
int main()
{
    scanf("%d%d%d", &n, &m, &k);
    vector<int> vt;
    for(int i = 1; i <= k; ++i) 
    {
        scanf("%d%d%d", &a[i].x, &a[i].y, &a[i].p);
        vt.push_back(a[i].y);
    }
    sort(vt.begin(), vt.end());
    vt.erase(unique(vt.begin(), vt.end()), vt.end());
    for(int i = 1; i <= k; ++i) a[i].y = lower_bound(vt.begin(), vt.end(), a[i].y) - vt.begin() + 1;
    m = vt.size() + 10;
    sort(a + 1, a + k + 1);
    for(int i = 1; i <= k; ++i)
    {
        dp[i] = query(a[i].y) + a[i].p;
        ans = max(ans, dp[i]);
        update(a[i].y, dp[i]);
    }
    printf("%d\n", ans);
    return 0;
}