2019年9月2日
Next_permutation 快速生成全排列
摘要： ``` string s; s="abc"; do { cout 阅读全文
posted @ 2019-09-02 18:58 ALEZ 阅读(205) 评论(0) 推荐(0)
Path Queries CF
摘要： You are given a weighted tree consisting of n vertices. Recall that a tree is a connected graph without cycles. Vertices ui and vi are connected by an 阅读全文
posted @ 2019-09-02 14:12 ALEZ 阅读(227) 评论(0) 推荐(0)