n <= 1000000
0<=ai,bi<=1000000
0<=ci<=1000000
数据输出建议使用long long类型(Pascal为int64或者qword类型)
#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
int n,m,i,j;
struct data
{
long long x,y,v;
};data a[1000003];
long long f[1000003];
long long cmp(data x,data y)
{
return x.y<y.y;
}
int erfen(int x,int y)
{
int head=x; int tail=y;
int mid;
int ans;
while (head<=tail)
{
mid=(head+tail)/2;
if ((head+tail)%2) mid++;//不加这一句很可能死在里面!
if (a[mid].y<=a[y+1].x)
{
if (head==tail)
break;
head=mid;
}
else
{
tail=mid-1;
}
}
return tail;
}
int main()
{
scanf("%d",&n);
for (i=1;i<=n;i++)
{
scanf("%lld%lld%lld",&a[i].x,&a[i].y,&a[i].v);
if(a[i].x>a[i].y)
swap(a[i].x,a[i].y);
}
sort(a+1,a+n+1,cmp);
f[1]=a[1].v;
for (i=2;i<=n;i++)
{
if (a[i].x>=a[i-1].y)
a[i].v=a[i-1].v+a[i].v;
else
a[i].v=max(a[i-1].v,a[erfen(1,i-1)].v+a[i].v);
f[i]=a[i].v;
}
printf("%lld",f[n]);
}