Intel Code Challenge Elimination Round (Div.1 + Div.2, combined) C. Destroying Array 双向链表+反向做+优先队列
C. Destroying Array 双向链表+反向做+优先队列 My Solution 双向链表+反向做+优先队列 反向做,按…
C. Destroying Array 双向链表+反向做+优先队列 My Solution 双向链表+反向做+优先队列 反向做,按…
D. Fix a Tree dfs+剪枝+标记数组 Source Codeforces Round #363 (Div. 2) My Solution dfs…
C. Vacations 贪心+dp Source Codeforces Round #363 (Div. 2) My Solution 贪心+dp //!从…
LCIS dp Source BestCoder Round #87 My Solution dp、LCIS、 最长公共上升子序列且每次递增 …
C. They Are Everywhere two pointers or binary search Source Codeforces Round #364 (Div. 2) &…
D. As Fast As Possible binary search、方程 或解方程 直接解出答案 Source Codeforces Round #36…
B. Complete the Word two pointers、队列(queue) Source Codeforces Round #372 (Div. 2) …
D. Complete The Graph 图论、最短路、Dijkstra、路径、分配部分边权 Source Codeforces Round #37…
C. Sonya and Queries 压位、二进制来状态压缩 Source Codeforces Round #371 (Div. 2) My …
D. Mishka and Interesting sum 离线操作,树状数组,last[value],异或和 Source Codeforces Roun…