D. Friends and Subsequences Codeforces Round #361 (Div. 2)RMQ+二分 && 单调队列
D. Friends and Subsequences Codeforces Round #361 (Div. 2) RMQ+二分,单调队列
THE NOTEBOOK / ARCHIVE
D. Friends and Subsequences Codeforces Round #361 (Div. 2) RMQ+二分,单调队列
codeforces E1&E2 Array and Segments 差分+思维
F1 & F2 Pictures with Kittens (easy and hard version) dp,单调队列
F1&F2. Microtransactions (easy& hard version) 二分,贪心
D2. Remove the Substring (hard version) codeforces 思维,字符串
F2. Spanning Tree with One Fixed Degree 并查集+dfs+bfs tarjan+bfs
codeforces E1. String Coloring (easy version) and E2. String Coloring (hard version)
E. Minimum Array 详解 思维,二分,multiset
D. Maximum Sum of Products Educational Codeforces Round 108 (Rated for Div. 2) 区间dp,前缀和
C. Schedule Management Educational Codeforces Round 131 (Rated for Div. 2)二分
codeforces #693 E.Correct Placement problem-1472E(思维,排序)。极易理解。
D2. RGB Substring (hard version) codeforces #575 div3 前缀和 构造
链接:https://codeforces.com/problemset/problem/1512/DCorrupted ArrayYou are given a number n and an array b1,b2,…,bn+2, obtained according to the follow
链接:https://codeforces.com/problemset/problem/1512/CA-B PalindromeYou are given a string s consisting of the characters ‘0’, ‘1’, and ‘?’. You need to
这里还没有文章。