你有$n$个区间$[l_i, r_i]$, 你要恰好删掉一个区间,使得剩下的$n-1$个区间的并的总和最多
eg. [1,2], [3,5], [3,7]的并是[1,2], [3,7]
little_sun
Solar System
文章
72
分类
5
标签
58
Update your browser to view this website correctly. Update my browser now
×