https://blog.csdn.net/csyifanZhang/article/details/106035134 ↑ 完整题解 struct E { ll t, f, h; }v[MAX]; bool cmp(E e1, E e2) { return e1.t < e2.t; } ll D, G, maxAlive, minDepart; ll exist[105][1000][105];//遍历到第i个垃圾，还能苟j小时，高度为k //当前便利到第k个垃圾，能够活到sur，总高度height void df...