随笔分类 -  codeforces题解

Codeforces Round #673 (Div. 2)
摘要：[Codeforces Round #673 (Div. 2) ] 题目链接# A. Copy-paste 思路： 贪心的策略。每次只加上最小的就可以了 #include<bits/stdc++.h> using namespace std; const int INF=0x3f3f3f3f; ty 阅读全文
posted @ 2020-09-28 16:06 william4s 阅读(257) 评论(0) 推荐(1)
Codeforces Round #672 (Div. 2) A - C1题解
摘要：[Codeforces Round #672 (Div. 2) A - C1 ] 题目链接# A. Cubes Sorting 思路： “ If Wheatley needs more than \(\frac{n \cdot (n-1)}{2}-1\) exchange operations, h 阅读全文
posted @ 2020-09-25 15:42 william4s 阅读(168) 评论(0) 推荐(0)