这里会显示出您选择的修订版和当前版本之间的差别。
两侧同时换到之前的修订记录 前一修订版 后一修订版 | 前一修订版 | ||
2020-2021:teams:mian:weekly_report:2020_spring_semester_week_14_report [2020/05/28 17:34] withinlover [专题] |
2020-2021:teams:mian:weekly_report:2020_spring_semester_week_14_report [2020/07/05 11:33] (当前版本) grapelemonade ↷ 链接因页面移动而自动修正 |
||
---|---|---|---|
行 3: | 行 3: | ||
====== 团队训练 ====== | ====== 团队训练 ====== | ||
- | [[2020-2021:teams:mian:hdutraining:2016 Multi-University Training Contest 1|2016 Multi-University Training Contest 1]] ''%%task: 6/8/11%%'', ''%%rank: 27/532%%'' | + | [[2020-2021:teams:mian:hdu_training:2016_multi-university_training_contest_1|2016 Multi-University Training Contest 1]] ''%%task: 6/8/11%%'', ''%%rank: 27/532%%'' |
====== 本周推荐 ====== | ====== 本周推荐 ====== | ||
行 9: | 行 9: | ||
=== Pantw === | === Pantw === | ||
+ | [[http://acm.hdu.edu.cn/showproblem.php?pid=5724|HDU5724(SG 函数,Nim 和)]] | ||
=== Withinlover === | === Withinlover === | ||
行 20: | 行 21: | ||
=== Gary === | === Gary === | ||
+ | [[http://www.lydsy.com/JudgeOnline/problem.php?id=1086|BZOJ1086(树上分块的方式)]] | ||
+ | [[http://www.lydsy.com/JudgeOnline/problem.php?id=1086|SP10707-Count on a tree II]] | ||
+ | |||
+ | [[http://uoj.ac/problem/58|WC2013糖果公园]] | ||
+ | |||
+ | ====== 算法 ====== | ||
+ | |||
+ | [[2020-2021:teams:mian:withinlover:mos_algorithm|带修莫队]] | ||
+ | |||
+ | [[2020-2021:teams:mian:gary:mos_algorithm_tree|树上莫队]] | ||
====== Pantw ====== | ====== Pantw ====== | ||
行 30: | 行 41: | ||
- | ===== 比赛 ===== | ||
+ | 写了几个题,放了几个感觉好的在上面的推荐里。 | ||
- | ===== 题目 ===== | + | 题解咕咕咕了。。。。 |
+ | 我爱数分我爱基物我爱离散 | ||
====== Gary ====== | ====== Gary ====== | ||
+ | ==== 专题 ==== | ||
+ | [[2020-2021:teams:mian:gary:mos_algorithm_tree|树上莫队]] | ||
+ | ==== 其他 ==== | ||
- | ===== 专题 ===== | + | 总结了树上莫队 |
- | + | ||
- | ===== 比赛 ===== | + | |
- | + | ||
- | ===== 题目 ===== | + | |
+ | 推荐两个题 | ||
+ | 复习去了 | ||