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 consists of a line with infinite length and cursor, which ...
2019-11-30 11:38 0 339 推荐指数：
[Educational Codeforces Round 81 (Rated for Div. 2)]E. Permutation Separation（线段树，思维，前缀和） E. Permutation Separation time limit per test 2 seconds ...
A. Sweet Problem You have three piles of candies: red, green and blue candies: the fi ...
Codeforces Round #600 (Div. 2) E. Antenna Coverage（dp） 题目链接 题意： m个Antenna，每个Antenna的位置是$x_i$，分数是$s_i$,覆盖范围是$[x_i - s_i; x_i + s_i]$,每个硬币可以使一个 ...
Educational Codeforces Round 76 (Rated for Div. 2) E. The Contest（dp+线段树） 题目链接 题意： 给定3个人互不相同的多个数字，可以把数字移动给别人，问最少移动几次后可以使第一个人的数字为1~m1,第二个人m1~m2,第三个 ...
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 ...
http://codeforces.com/contest/1293/problem/E 题意： 给出一棵n个点的树，将0—n-2作为边权，最大化 Σ mex(u,v) mex(u,v) 表示u到v的路径上最小的未出现过的自然数 将[0,m]加到一条链上，且这条链上加的边权 ...
[Codeforces Round #630 (Div. 2)] - E. Height All the Same （组合数学） E. Height All the Same time limit per test 2 seconds memory limit per test 512 ...
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 ...
