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
58
59
60
61
62
63
64
65
66
67
68
69
| #include<algorithm>
#include<iostream>
#include<iomanip>
#include<cstring>
#include<cstdlib>
#include<vector>
#include<cstdio>
#include<cmath>
#include<queue>
using namespace std;
inline const int Get_Int() {
int num=0,bj=1;
char x=getchar();
while(x<'0'||x>'9') {
if(x=='-')bj=-1;
x=getchar();
}
while(x>='0'&&x<='9') {
num=num*10+x-'0';
x=getchar();
}
return num*bj;
}
const int maxn=100005;
struct Person {
int x,y,v;
bool operator < (const Person& b) const {
return x<b.x||(x==b.x&&y<b.y);
}
} a[maxn];
int n,m,k,tmp[maxn],b[maxn],f[maxn],ans=0;
struct BIT {
int c[maxn];
#define lowbit(x) x&(-x)
void add(int x,int v) {
for(int i=x; i<=k; i+=lowbit(i))c[i]=max(c[i],v);
}
int sum(int x) {
int sum=0;
for(int i=x; i>=1; i-=lowbit(i))sum=max(sum,c[i]);
return sum;
}
} bit;
void Discretization(int* a) {
memcpy(b,a,sizeof(b));
sort(a+1,a+k+1);
int cnt=unique(a+1,a+k+1)-a-1;
for(int i=1; i<=k; i++)b[i]=lower_bound(a+1,a+cnt+1,b[i])-a;
}
int main() {
n=Get_Int();
m=Get_Int();
k=Get_Int();
for(int i=1; i<=k; i++) {
a[i].x=Get_Int();
tmp[i]=Get_Int();
a[i].v=Get_Int();
}
Discretization(tmp);
for(int i=1; i<=k; i++)a[i].y=b[i];
sort(a+1,a+k+1);
for(int i=1; i<=k; i++) {
f[i]=bit.sum(a[i].y)+a[i].v;
ans=max(ans,f[i]);
bit.add(a[i].y,f[i]);
}
printf("%d\n",ans);
return 0;
}
|
