题意:
有n个戒指,(n<=1e5),戒指有内径r,外径R,高度h,把它们堆成一个塔,要求是上面的戒指外径必须大于等于下面的,且上面的外径必须大于它下面一个的内径(不然就放不上去,会从中间掉下去),问塔最高能多高。
分析
简单来说题意就是寻找一个序列满足对于任意一个正整数1<=i<=n满足
R[i-1]>=R[i]&&r[i-1]
code
#include<bits/stdc++.h>
#define M 500005
using namespace std;
void read(int &x){
x=0; char c=getchar();
for (;c<48;c=getchar());
for (;c>47;c=getchar())x=(x<<1)+(x<<3)+(c^48);
}
struct node{
int r,R,h;
}a[M];
bool cmp(node a,node b){
if (a.R!=b.R)return a.R>b.R;
if (a.r!=b.r)return a.r>b.r;
return a.h>b.h;
}
void Max(int &x,int y){
if (x<y)x=y;
}
#define ll long long
void Max(ll &x,ll y){
if (x<y)x=y;
}
int q[M];
struct Tree{
#define ls (p<<1)
#define rs (p<<1|1)
ll f[M<<2];
ll qu(int l,int r,int x,int p){
if (l==r)return f[p];
int mid=(l+r)>>1;
if (x<=mid)return max(f[p],qu(l,mid,x,ls));
else return max(f[p],qu(mid+1,r,x,rs));
}
void upd(int l,int r,int x,int y,ll val,int p){
if (l==x&&r==y){
Max(f[p],val);
return;
}
int mid=(l+r)>>1;
if (y<=mid)upd(l,mid,x,y,val,ls);
else if (x>mid)upd(mid+1,r,x,y,val,rs);
else upd(l,mid,x,mid,val,ls),upd(mid+1,r,mid+1,y,val,rs);
}
}T;
ll dp[M];
inline int ch(int l,int r,int x){
for (;;){
int mid=(l+r)>>1;
if (q[mid]==x)return mid;
if (q[mid]<x)l=mid+1;else r=mid-1;
}
}
int main(){
//freopen("1.in","r",stdin);
int n,cnt=0;
read(n);
for (int i=1;i<=n;i++){
read(a[i].r); read(a[i].R); read(a[i].h);
q[++cnt]=a[i].r;
q[++cnt]=a[i].R;
}
sort(q+1,q+cnt+1);
cnt=unique(q+1,q+cnt+1)-q-1;
sort(a+1,a+n+1,cmp);
ll res=0;
for (int i=1;i<=n;i++){
a[i].r=ch(1,cnt,a[i].r);
a[i].R=ch(1,cnt,a[i].R);
dp[i]=T.qu(1,cnt,a[i].R,1)+a[i].h;
Max(res,dp[i]);
if (a[i].r+1<=a[i].R)T.upd(1,cnt,a[i].r+1,a[i].R,dp[i],1);
}
printf("%lld\n",res);
return 0;
}