摘要: ###CF1601D Difficult Mountain > https://www.luogu.com.cn/problem/CF1601D 一道神必贪心 首先我们分类考虑贪心的几种情况 对于两个人$i$与$j$,并且两人都满足s>p $1.s[i]<a[i]$ $\space \space 1 阅读全文
posted @ 2023-07-13 11:33 Diamondan 阅读(17) 评论(0) 推荐(0)