# [CF2082D](https://codeforces.com/contest/2082/problem/D) 难啊 贪心构造题 之前好多这种题都是通过一些必要条件限制找到答案的上限/下限，然后一定存在构造 但是要找对方向（这题利用的是相邻逆序对每次操作最多减少2）并且限制严格（这题容易被放不下这种特殊情况困扰，但多花费最多1步可以解决） [Submission #345017669 - Codeforces](https://codeforces.com/contest/2082/submission/345017669) # [CF2082E](https://codeforces.com/contest/2082/problem/E) 难啊 又是一道贪心题 但这个贪心分成三部分一点也不好想也不好证明 每一部分就相当于在当前的条件下找到性价比最高的消除方法（在每一部分中操作次数都达到极限） [Submission #345169976 - Codeforces](https://codeforces.com/contest/2082/submission/345169976) # [CF2082F](https://codeforces.com/contest/2082/problem/F) 好题啊！ 数据范围就告诉我们这题跟值域有关 又是一个很妙的贪心，直接不考虑不可能（一定存在更优方案）成为的边来缩小范围 [Submission #345134987 - Codeforces](https://codeforces.com/contest/2082/submission/345134987) # [CF2085D](https://codeforces.com/contest/2085/problem/D) 简单贪心题 [Submission #345272800 - Codeforces](https://codeforces.com/contest/2085/submission/345272800) # [CF2085E](https://codeforces.com/contest/2085/problem/E) 和上面的那个一样值域很小确实给出了方向 [Submission #345292169 - Codeforces](https://codeforces.com/contest/2085/submission/345292169) # [CF2085F1](https://codeforces.com/contest/2085/problem/F1) & [CF2085F2](https://codeforces.com/contest/2085/problem/F2) 分成两个难度很良心啊 从 F1 到 F2 实际就是对暴力进行简单的贪心优化 [Submission #345298692 - Codeforces](https://codeforces.com/contest/2085/submission/345298692) [Submission #345302887 - Codeforces](https://codeforces.com/contest/2085/submission/345302887) # [CF2078D](https://codeforces.com/contest/2078/problem/D) [Submission #345333446 - Codeforces](https://codeforces.com/contest/2078/submission/345333446) # [CF2078E](https://codeforces.com/contest/2078/problem/E) [Submission #345485042 - Codeforces](https://codeforces.com/contest/2078/submission/345485042) Loading... # [CF2082D](https://codeforces.com/contest/2082/problem/D) 难啊 贪心构造题 之前好多这种题都是通过一些必要条件限制找到答案的上限/下限，然后一定存在构造 但是要找对方向（这题利用的是相邻逆序对每次操作最多减少2）并且限制严格（这题容易被放不下这种特殊情况困扰，但多花费最多1步可以解决） [Submission #345017669 - Codeforces](https://codeforces.com/contest/2082/submission/345017669) # [CF2082E](https://codeforces.com/contest/2082/problem/E) 难啊 又是一道贪心题 但这个贪心分成三部分一点也不好想也不好证明 每一部分就相当于在当前的条件下找到性价比最高的消除方法（在每一部分中操作次数都达到极限） [Submission #345169976 - Codeforces](https://codeforces.com/contest/2082/submission/345169976) # [CF2082F](https://codeforces.com/contest/2082/problem/F) 好题啊！ 数据范围就告诉我们这题跟值域有关 又是一个很妙的贪心，直接不考虑不可能（一定存在更优方案）成为的边来缩小范围 [Submission #345134987 - Codeforces](https://codeforces.com/contest/2082/submission/345134987) # [CF2085D](https://codeforces.com/contest/2085/problem/D) 简单贪心题 [Submission #345272800 - Codeforces](https://codeforces.com/contest/2085/submission/345272800) # [CF2085E](https://codeforces.com/contest/2085/problem/E) 和上面的那个一样值域很小确实给出了方向 [Submission #345292169 - Codeforces](https://codeforces.com/contest/2085/submission/345292169) # [CF2085F1](https://codeforces.com/contest/2085/problem/F1) & [CF2085F2](https://codeforces.com/contest/2085/problem/F2) 分成两个难度很良心啊 从 F1 到 F2 实际就是对暴力进行简单的贪心优化 [Submission #345298692 - Codeforces](https://codeforces.com/contest/2085/submission/345298692) [Submission #345302887 - Codeforces](https://codeforces.com/contest/2085/submission/345302887) # [CF2078D](https://codeforces.com/contest/2078/problem/D) [Submission #345333446 - Codeforces](https://codeforces.com/contest/2078/submission/345333446) # [CF2078E](https://codeforces.com/contest/2078/problem/E) [Submission #345485042 - Codeforces](https://codeforces.com/contest/2078/submission/345485042) 最后修改：2025 年 10 月 26 日 © 允许规范转载 赞 如果觉得我的文章对你有用，请随意赞赏