我的随笔

PAT-Battle Over Cities - Hard Version (35 分)-最小生成树

alusang 2019-07-13 14:48 阅读:308 评论:0 推荐:0

Codeforces-Round#547(Div.3)-C-Polycarp Restores Permutation

alusang 2019-04-17 23:01 阅读:131 评论:0 推荐:0

Codeforces-Round#548(Div.2)-C-Edgy Trees-快速幂

alusang 2019-03-23 22:48 阅读:197 评论:0 推荐:0

Codeforces-Round#546(Div.2)-D-Nastya Is Buying Lunch

alusang 2019-03-21 00:04 阅读:147 评论:0 推荐:0

Codeforces-Round#546(Div.2)-C-Nastya Is Transposing Matrices

alusang 2019-03-20 22:14 阅读:82 评论:0 推荐:0

HDU-2108-叉积判断凸多边形

alusang 2019-03-14 10:23 阅读:308 评论:0 推荐:0

HDU-1142-最短路+记忆化搜索

alusang 2019-03-07 14:22 阅读:357 评论:0 推荐:0

HDU-5441-离线化并查集

alusang 2019-03-05 23:34 阅读:169 评论:0 推荐:0

PAT-Radix (25)-二分

alusang 2019-02-20 22:58 阅读:144 评论:0 推荐:0

PAT-Travel Plan (30)-Dijkstra和SPFA

alusang 2019-02-20 09:26 阅读:193 评论:3 推荐:0