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]$,每個硬幣可以使一個 ...
原文：Codeforces Round #616 (Div. 2) E. Prefix Enlightenment 圖論
E. Prefix Enlightenment time limit per test seconds memory limit per test megabytes There are n lamps on a line, numbered from to n. Each one has an initial state off or on . You re given k subsets A ...
2020-02-03 19:37 0 330 推薦指數：
相關推薦
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)解題報告
Codeforces Round #616 (Div. 2)解題報告 A. Even But Not Even 找兩個奇數就行了。 B. Array Sharpening 貪心+構造。 就從0開始往上走，看看最遠能走到哪，看代碼。 C. Mind Control 這道題題意 ...
Codeforces Round #614 (Div. 2) E. Xenon's Attack on the Gangs
http://codeforces.com/contest/1293/problem/E 題意： 給出一棵n個點的樹，將0—n-2作為邊權，最大化 Σ mex(u,v) mex(u,v) 表示u到v的路徑上最小的未出現過的自然數 將[0,m]加到一條鏈上，且這條鏈上加的邊權 ...
[Educational Codeforces Round 81 (Rated for Div. 2)]E. Permutation Separation（線段樹，思維，前綴和）
[Educational Codeforces Round 81 (Rated for Div. 2)]E. Permutation Separation（線段樹，思維，前綴和） E. Permutation Separation time limit per test 2 seconds ...
[Codeforces Round #630 (Div. 2)] - E. Height All the Same （組合數學）
[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 ...
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 ...