Codeforces Round #598 (Div. 3)
传送门 A. Payment Without Change 签到。 Code B. Minimize the Permutation 题意： 给出一个\(1\)~\(n\)的 ...
原文：Codeforces Round #598 (Div. 3) E. Yet Another Division Into Teams dp
E. Yet Another Division Into Teams There are n students at your university. The programming skill of the i th student is ai. As a coach, you want to divide them into teams to prepare them for the upco ...
2019-11-05 15:52 1 299 推荐指数：
相关推荐
Codeforces Round #603 (Div. 2) E. Editor 线段树
E. Editor The development of a text editor is a hard problem. You need to implement an extra module for brackets coloring in text. Your editor ...
Educational Codeforces Round 76 (Rated for Div. 2) E. The Contest
Educational Codeforces Round 76 (Rated for Div. 2) E. The Contest（dp+线段树） 题目链接 题意： 给定3个人互不相同的多个数字，可以把数字移动给别人，问最少移动几次后可以使第一个人的数字为1~m1,第二个人m1~m2,第三个 ...
Codeforces Round #616 (Div. 2) E. Prefix Enlightenment 图论
E. Prefix Enlightenment time limit per test3 seconds memory limit per test256 megabytes There are n lamps on a line, numbered from 1 to n. Each one ...
Codeforces Round #600 (Div. 2) E. Antenna Coverage
Codeforces Round #600 (Div. 2) E. Antenna Coverage（dp） 题目链接 题意： m个Antenna，每个Antenna的位置是$x_i$，分数是$s_i$,覆盖范围是$[x_i - s_i; x_i + s_i]$,每个硬币可以使一个 ...
【CF1256】Codeforces Round #598 (Div. 3) 【思维+贪心+DP】
https://codeforces.com/contest/1256 A：Payment Without Change【思维】 题意：给你a个价值n的物品和b个价值1的物品，问是否存在取物方案使得价值为s 题解：min(s/n,a)*n+b>=s?YES:NO B ...
Educational Codeforces Round 92 (Rated for Div. 2) E. Calendar Ambiguity
题目链接：http://codeforces.com/contest/1389/problem/E 大概题意：某个国家一年有m个月，每个月有d天，一个星期有w天。(x,y)且(x<y)，表示x月y天，如果x月y天和y月x天是一周中的同一天，则(x,y)是好的，问你第一年中有多少个好 ...
Codeforces Round #598 (Div. 3) C. Platforms Jumping
There is a river of width n">nn. The left bank of the river is cell 0">00 and the right bank is c ...