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 ...
