![](https://img-blog.csdnimg.cn/20201014180756724.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
Daily Practice(蒟蒻成长计划)
文章平均质量分 75
_dawn°
ACMer~但是很菜
展开
-
Codeforces Round 861 (Div. 2)(A~D)
考虑这样一种做法,目标数字的高位与l或r相同,后面的几位都是相同的,这样可以尽可能缩小后面几位的差别对结果的影响,具体见代码。因为k一定是奇数,所以对称的位置的奇偶性都是相同的,我们可以对于每个数计算与它可以配对的数量,具体做法可以在区间内二分找到配对的个数。思路:观察计算操作,我们需要对于每一列进行操作,而且可以发现排序完成后每个数对于结果的贡献是(n - i) * a[i] - (i - 1) * a[i],其中i是该数的索引,n是数字个数。给出n个数组,对于每对数组,计算题目中给出的值的和。原创 2023-04-25 20:15:44 · 685 阅读 · 1 评论 -
Codeforces Round 864 (Div. 2)(A~D)
Codeforces Round 864 (Div. 2)(A~D)原创 2023-04-24 20:40:13 · 859 阅读 · 0 评论 -
Codeforces Round 865 (Div. 2)(A~C)
思路:实际上有两种思路,一是以第一个数为基准,令后面的数全部进行操作使得第一个数到第n-1个数全部相同,然后判断第n个数和前一个数的大小关系;有一个2*n的矩阵,在其中填入2n个数,,每次从(1, 1)出发到达(2, n),只采用向下走或者向右走两种方式,最大化所有路径中价值最小的路径,给出构造方案。给出一个点(a, b),用最多两步从(0, 0)到达(a, b),且每一步的起点和终点的连线都不经过任何其他点,给出两步的目标点。思路: 最大化最小值,可以考虑所有路径的价值都趋于相同。原创 2023-04-23 19:58:55 · 281 阅读 · 0 评论 -
Codeforces Round 838 (Div. 2)(A~D)
Codeforces Round 838 (Div. 2)(A~D)原创 2023-03-20 21:36:43 · 342 阅读 · 0 评论 -
Codeforces Round 858 (Div. 2)(A~E)
Codeforces Round 858 (Div. 2)(A~E)原创 2023-03-19 21:27:06 · 1270 阅读 · 8 评论 -
Educational Codeforces Round 132 (Rated for Div. 2)(A~D)
Educational Codeforces Round 132 (Rated for Div. 2)(A~D)原创 2023-03-17 21:45:33 · 427 阅读 · 0 评论 -
Codeforces Round 775 (Div. 2, based on Moscow Open Olympiad in Informatics)(A~D)
Codeforces Round 775 (Div. 2, based on Moscow Open Olympiad in Informatics)(A~D)原创 2023-03-15 22:53:12 · 95 阅读 · 0 评论 -
Nebius Welcome Round (Div. 1 + Div. 2)(A~D)
Nebius Welcome Round (Div. 1 + Div. 2)(A~D)原创 2023-03-13 20:26:05 · 739 阅读 · 0 评论 -
Codeforces Round 703 (Div. 2)(A~D)
Codeforces Round 703 (Div. 2)(A~D)原创 2023-03-08 18:29:55 · 314 阅读 · 0 评论 -
Codeforces Round 856 (Div. 2)(A~D)
Codeforces Round 856 (Div. 2)(A~D)原创 2023-03-07 16:24:16 · 610 阅读 · 0 评论 -
Educational Codeforces Round 143 (Rated for Div. 2)(A~D)
Educational Codeforces Round 143 (Rated for Div. 2)(A~D)原创 2023-03-06 19:46:52 · 274 阅读 · 0 评论 -
Codeforces Round #852 (Div. 2)(A~D)
Codeforces Round #852 (Div. 2)(A~D)原创 2023-03-01 23:44:09 · 181 阅读 · 0 评论 -
Codeforces Round #851 (Div. 2)(A~D)
Codeforces Round #851 (Div. 2)(A~D)原创 2023-02-27 19:36:21 · 418 阅读 · 1 评论 -
Codeforces Round #850 (Div. 2, based on VK Cup 2022 - Final Round)(A~E)
Codeforces Round #850 (Div. 2, based on VK Cup 2022 - Final Round)(A~E)原创 2023-02-24 20:11:59 · 550 阅读 · 0 评论 -
Codeforces Round #849 (Div. 4)(E~G)
Codeforces Round #849 (Div. 4)(E~G)原创 2023-02-23 17:14:01 · 596 阅读 · 1 评论 -
Codeforces Round #848 (Div. 2)(A~D)
Codeforces Round #848 (Div. 2)(A~D)原创 2023-02-22 22:32:08 · 492 阅读 · 0 评论 -
TypeDB Forces 2023 (Div. 1 + Div. 2, Rated, Prizes!)(A~E)
TypeDB Forces 2023 (Div. 1 + Div. 2, Rated, Prizes!)(A~E)原创 2023-02-21 23:39:58 · 399 阅读 · 0 评论 -
Codeforces Round #847 (Div. 3)(A~F)
Codeforces Round #847 (Div. 3)(A~F)原创 2023-02-20 23:28:07 · 222 阅读 · 0 评论 -
Codeforces Round #841 (Div. 2) and Divide by Zero 2022(A~E)
Codeforces Round #841 (Div. 2) and Divide by Zero 2022(A~E)原创 2023-01-11 23:50:01 · 557 阅读 · 0 评论 -
Codeforces Round #840 (Div. 2) and Enigma 2022 - Cybros LNMIIT(A~C)
Codeforces Round #840 (Div. 2) and Enigma 2022 - Cybros LNMIIT(A~C)原创 2023-01-08 17:45:11 · 172 阅读 · 0 评论 -
Codeforces Round #839 (Div. 3)(A~F)
Codeforces Round #839 (Div. 3)(A~F)原创 2023-01-06 12:42:07 · 767 阅读 · 0 评论 -
Polynomial Round 2022 (Div. 1 + Div. 2, Rated, Prizes!)(A~E)
Polynomial Round 2022 (Div. 1 + Div. 2, Rated, Prizes!)(A~E)原创 2023-01-05 19:13:10 · 480 阅读 · 0 评论 -
Educational Codeforces Round 140 (Rated for Div. 2)(A,B,D)
Educational Codeforces Round 140 (Rated for Div. 2)(A,B,D)原创 2023-01-03 23:42:56 · 456 阅读 · 0 评论 -
Daily Practice:Codeforces Round #794 (Div. 2)(A~D)
Daily Practice:Codeforces Round #794 (Div. 2)原创 2022-07-04 10:55:12 · 257 阅读 · 0 评论 -
Daily Practice:Educational Codeforces Round 109 (Rated for Div. 2)
Daily Practice:Educational Codeforces Round 109 (Rated for Div. 2)原创 2022-05-11 21:35:31 · 112 阅读 · 1 评论 -
Daily Practice:Codeforces Round #723 (Div. 2)
Daily Practice:Codeforces Round #723 (Div. 2)原创 2022-05-05 19:11:37 · 149 阅读 · 0 评论 -
Daily Practice:Educational Codeforces Round 112 (Rated for Div. 2) D. Say No to Palindromes
Educational Codeforces Round 112 (Rated for Div. 2) D. Say No to Palindromes原创 2022-04-26 19:00:23 · 322 阅读 · 0 评论 -
Daily Practice 14th:Codeforces Round #742 (Div. 2)
Daily Practice 14th原创 2022-04-19 19:33:02 · 124 阅读 · 0 评论 -
Daily Practice 13th:Codeforces Round #743 (Div. 2)
Daily Practice 13th原创 2022-04-16 12:44:38 · 198 阅读 · 0 评论 -
Daily Practice 12th:Educational Codeforces Round 114 (Rated for Div. 2)
Daily Practice 12th原创 2022-04-14 21:23:23 · 507 阅读 · 0 评论 -
Daily Practice 11th:Codeforces Round #745 (Div. 2)(A,B)
Daily Practice 11th原创 2022-04-13 21:43:20 · 155 阅读 · 0 评论 -
Daily Practice 10th:Educational Codeforces Round 115 (Rated for Div. 2)
Daily Practice 10th原创 2022-04-12 20:20:52 · 235 阅读 · 0 评论 -
Daily Practice 9th:Codeforces Round #781 (Div. 2)
Daily Practice 9th原创 2022-04-10 19:53:29 · 479 阅读 · 0 评论 -
Daily Practice 8th:Codeforces Round #750 (Div. 2)
Daily Practice 8th原创 2022-04-08 19:59:56 · 523 阅读 · 0 评论 -
Daily Practice 7th:Codeforces Round #754 (Div. 2)
VP*7;rating:800--1000--1400--2100A. A.M. Deviation给出三个数,这三个数的arithmetic是其中两个数的和与第三个数两倍的差的绝对值,给出一种操作,即随意在三个数中选择两个,其中一个-1,另一个+1,问给出的三个数经过若干次操作后arithmetic最小是多少。思路: 我们可以看这种操作的实质:若是选择两个需要相加的数,则没有任何变化;若是选择一个需要相加的数,另一个是要乘2的数,则对arithmetic的贡献是+3或-3,那就和对3取原创 2022-04-07 19:21:55 · 234 阅读 · 0 评论 -
Daily Practice 6th:Educational Codeforces Round 117 (Rated for Div. 2)
Daily Practice 6th原创 2022-04-07 00:12:21 · 414 阅读 · 0 评论 -
Daily Practice 5th:Educational Codeforces Round 120 (Rated for Div. 2)
Daily Practice 5th原创 2022-04-05 20:17:32 · 463 阅读 · 0 评论 -
Daily Practice 4th: Codeforces Round #766 (Div. 2)
Daily Practice 4th原创 2022-04-04 21:02:45 · 551 阅读 · 0 评论 -
Daily Practice 3rd: Codeforces Round #757 (Div. 2)
Daily Practice 3rd原创 2022-04-02 21:36:42 · 267 阅读 · 0 评论 -
Daily Practice 2nd:Educational Codeforces Round 119 (Rated for Div. 2)
Daily Practice 2nd原创 2022-04-01 21:17:19 · 251 阅读 · 0 评论