文章分类 -  Competitive Programming

Balanced Bracket
摘要：C. Recover an RBS Given a sequence of (, ) and ?, check if there is a unique way to replace all the ? with either ( or ). The given sequence is gurant 阅读全文
posted @ 2023-05-15 12:09 Review->Improve 阅读(30) 评论(0) 推荐(0)
Meet in the middle Search
摘要：Meet in the middle Search E. Maximum Subsequence F - Programming Contest F - XOR on Grid Path F - Robot Rotation 阅读全文
posted @ 2022-09-30 11:01 Review->Improve 阅读(12) 评论(0) 推荐(0)
Constructive Problems
摘要：C. Helping the Nature 3 available operations: (1). decrease a[0, i] by 1; (2). decrease a[i, n - 1] by 1; (3). increase a[0, n - 1] by 1. Key observat 阅读全文
posted @ 2021-09-25 11:42 Review->Improve 阅读(146) 评论(0) 推荐(0)
Dynamic Programming Problems
摘要：Dp with prefix / suffix result array D. Sorting By Multiplication F - Shortcuts Key takeaway: use the fact that we can only skip at most 28 checkpoint 阅读全文
posted @ 2021-09-01 12:28 Review->Improve 阅读(115) 评论(0) 推荐(0)
Graph Problems
摘要：Shortest Path Dijkstra, Bellman Ford, Floy Warshall BFS / DFS Minimum Spanning Tree Bipartite Graph C - Social Distance on Graph F - Merge Set Virtual 阅读全文
posted @ 2021-07-27 05:19 Review->Improve 阅读(135) 评论(0) 推荐(0)